On the relationship between π-calculus and finite place/transition petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5710 LNCS, Issue , 2009, Pages 463-480

  Meyer, Roland ^a   Gorrieri, Roberto ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

P/T NET; P/T PETRI NETS; PLACE/TRANSITION PETRI NETS; REACHABILITY; STRUCTURAL SEMANTICS;

GRAPH THEORY; PETRI NETS; SEMANTICS;

CALCULATIONS;

EID: 70349883951     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04081-8_31     Document Type: Conference Paper

References (26)

1. Amadio, R., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous π-calculus. Nord. J. Comp. 9(1), 70-101 (2002)
2. Busi, N., Gorrieri, R.: A Petri net semantics for π-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.962, pp. 145-159. Springer, Heidelberg (1995)
3. Busi, N., Gorrieri, R.: Distributed semantics for the π-calculus based on Petri nets with inhibitor arcs. J. Log. Alg. Prog. 78(1), 138-162 (2009)
4. Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. recursive definitions in channel based calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.2719, pp. 133-144. Springer, Heidelberg (2003)
5. Busi, N., Gabbrielli, M., Zavattaro, G.: Comparing recursion, replication, and iteration in process calculi. In: D́ýaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.3142, pp. 307-319. Springer, Heidelberg (2004)
6. Dam, M.: Model checking mobile processes. Inf. Comp. 129(1), 35-51 (1996)
7. Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S.,Winskel, G. (eds.) ICALP 1998. LNCS, vol.1443, pp. 103-115. Springer, Heidelberg (1998)
8. Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general π-calculus terms. For. Asp. Comp. 20(4-5), 429-450 (2008)
9. Engelfriet, J., Gelsema, T.: Multisets and structural congruence of the pi-calculus with replication. Theor. Comp. Sci. 211(1-2), 311-337 (1999)
10. Engelfriet, J., Gelsema, T.: A new natural structural congruence in the pi-calculus with replication. Acta Inf. 40(6), 385-430 (2004)
11. Engelfriet, J.: A multiset semantics for the pi-calculus with replication. Theor. Comp. Sci. 153(1-2), 65-94 (1996)
12. Ferrari, G.-L., Gnesi, S., Montanari, U., Pistore, M.: A model-checking verification environment for mobile processes. ACM Trans. Softw. Eng. Methodol. 12(4), 440-473 (2003)
13. Fokkink, W.: Modelling Distributed Systems. Springer, Heidelberg (2007)
14. Khomenko, V., Koutny, M., Niaouris, A.: Applying Petri net unfoldings for verification of mobile systems. In: Proc. of MOCA, Bericht FBI-HHB- 267/06, pp. 161-178. University of Hamburg (2006)
15. Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comp. 13(3), 441-460 (1984)
16. Meyer, R.: On boundedness in depth in the π-calculus. In: Proc. of IFIP TCS. IFIP, vol.273, pp. 477-489. Springer, Heidelberg (2008)
17. Meyer, R.: Structural Stationarity in the π-calculus. PhD thesis, Department of Computing Science, University of Oldenburg (2008)
18. Meyer, R.: A theory of structural stationarity in the π-calculus. Acta Inf. 46(2), 87-137 (2009)
19. Milner, R.: Communication and concurrency. Prentice Hall, Englewood Cliffs (1989)
20. Milner, R.: Communicating and Mobile Systems: the Π-Calculus. CUP, Cambridge (1999)
21. Minsky, M.: Computation: Finite and infinite Machines. Prentice Hall, Englewood Cliffs (1967)
22. Meyer, R., Khomenko, V., Strazny, T.: A practical approach to verification of mobile systems using net unfoldings. Fund. Inf. (to appear 2009)
23. Montanari, U., Pistore, M.: Checking bisimilarity for .nitary π-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.962, pp. 42-56. Springer, Heidelberg (1995)
24. Petruchio (2008), http://petruchio.informatik.uni-oldenburg.de
25. Pistore, M.: History Dependent Automata. PhD thesis, Dipartimento di Informatica, Università di Pisa (1999)
26. Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. CUP, Cambridge (2001)