Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference41 articles.
1. Amadio R.M., Meyssonnier C.: On decidability of the control reachability problem in the asynchronous π-calculus. Nord. J. Comput. 9(1), 70–101 (2002)
2. Bodei, C., Degano, P., Nielson, F., Riis Nielson, H.: Control flow analysis for the π-calculus. In: Proc. of the 9th International Conference on Concurrency Theory, CONCUR. LNCS, vol. 1466, pp. 84–98. Springer, Heidelberg (1998)
3. Busi, N., Gorrieri, R.: A Petri net semantics for π-calculus. In: Proc. of the 6th International Conference on Concurrency Theory, CONCUR. LNCS, vol. 962, pp. 145–159. Springer, Heidelberg (1995)
4. Busi, N., Gorrieri, R.: Distributed semantics for the π-calculus based on Petri nets with inhibitor arcs. Journal of Logic and Algebraic Programming, 46 pp. (2008, to appear)
5. Busi N.: Analysis issues in Petri nets with inhibitor arcs. Theor. Comput. Sci. 275(1–2), 127–177 (2002)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A counter abstraction technique for verifying properties of probabilistic swarm systems;Artificial Intelligence;2022-04
2. Introduction;Paradigms of Concurrency;2022
3. The Reachability Problem for Petri Nets Is Not Elementary;Journal of the ACM;2021-02
4. KReach: A Tool for Reachability in Petri Nets;Tools and Algorithms for the Construction and Analysis of Systems;2020
5. The reachability problem for Petri nets is not elementary;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23