Distributed semantics for the π-calculus based on Petri nets with inhibitor arcs

Journal of Logic and Algebraic Programming

Volumn 78, Issue 3, 2009, Pages 138-162

  Busi, Nadia ^a   Gorrieri, Roberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

calculus; Decidable properties; Non interleaving semantics; Petri nets; Process algebra

Indexed keywords

ALGEBRA; COMPUTABILITY AND DECIDABILITY; GRAPH THEORY; INFORMATION THEORY; MARINE BIOLOGY; PETRI NETS; SEMANTICS;

DECIDABLE PROPERTIES; DISTRIBUTED MODELS; INHIBITOR ARCS; LABELLED TRANSITION SYSTEMS; LINEAR TIME; NON-INTERLEAVING SEMANTICS; PROCESS ALGEBRA;

CALCULATIONS;

EID: 59349098616     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2008.08.002     Document Type: Article

References (50)

1. T. Agerwala, A complete model for representing the coordination of asynchronous processes, Hopkins Computer Research Report 32, John Hopkins University, 1974.
2. Berry G., and Boudol G. The chemical abstract machine. Theoret. Comput. Sci. 96 1 (1992) 217-248
3. Best E., Devillers R., and Koutny M. A unified model for nets and process algebras. Handbook of Process Algebra (2001), Elsevier pp. 873-944 (Chapter 14)
4. M. Boreale, D. Sangiorgi, A fully abstract semantics of causality in the π-calculus, Acta Inform. 35 (5) (1998) 353-400. An extended abstract appeared in Proc. STACS'95, LNCS 900, Springer, 1995, pp. 243-254.
5. Busi N. Analysis issues in Petri nets with inhibitor arcs. Theoret. Comput. Sci. 275 1-2 (2002) 127-177
6. Busi N., and Gorrieri R. Distributed conflicts in communicating systems. Object-Based Models and Languages for Concurrent Systems. LNCS vol. 924 (1994), Springer 49-65
7. Busi N., and Gorrieri R. A Petri Net Semantics for π- calculus. Proc. Concur'95. LNCS vol. 962 (1995), Springer 145-159
8. Busi N., and Pinna G.M. Process semantics for place/transition nets with inhibitor and read arcs. Fund. Inform. 40 2-3 (1999) 165-197
9. Busi N., and Pinna G.M. Comparing truly concurrent semantics for contextual place-transition nets. Fund. Inform. 44 3 (2000) 209-244
10. Cattani G.L., and Sewell P. Models for name-passing processes: interleaving and causal. Proc. LICS'00 (2000), IEEE Press 322-332
11. Cheng A., Esparza J., and Palsberg J. Complexity results for 1-safe nets. Theoret. Comput. Sci. 147 (1995) 117-136
12. M. Dam, Model checking mobile processes, Inform. Comput. 129 (1) (1996) 35-51. An extended abstract appeared in Proc. CONCUR'93, LNCS 715, Springer, 1993, pp. 22-36.
13. Darondeau Ph., and Degano P. Causal trees. Proc. ICALP'89. LNCS vol. 372 (1989), Springer 234-248
14. Degano P., De Nicola R., and Montanari U. A distributed operational semantics for CCS based on C/E systems. Acta Inform. 26 1-2 (1988) 59-91
15. Degano P., Gorrieri R., and Marchetti S. An exercise in concurrency: a CSP process as a condition/event system. Advances in Petri Nets 1988. LNCS vol. 340 (1988), Springer 85-105
16. Degano P., and Priami C. Causality for mobile processes. Proc. ICALP'95. LNCS vol. 944 (1995), Springer 660-671
17. Degano P., and Priami C. Non interleaving semantics for mobile processes. Theoret. Comput. Sci. 216 1-2 (1999) 237-270
18. Devillers R., Klaudel H., and Koutny M. Petri net semantics of the finite pi-calculus terms. Fund. Inform. 70 3 (2006) 203-226 An extended abstract appeared in Proc. FORTE'04, LNCS 3235, Springer, 2004, pp. 309-325
19. Devillers R., Klaudel H., and Koutny M. A Petri net translation of pi-calculus terms. Proc. ICTAC'06. LNCS vol. 4281 (2006), Springer 138-152
20. Engelfriet J. A multiset semantics for the π-calculus with replication. Theoret. Comput. Sci. 153 1-2 (1996) 65-94 An extended abstract appeared in Proc. CONCUR'93, LNCS 715, Springer, 1993, pp. 7-21
21. Esparza J. On the decidability of model-checking for several mu-calculi and Petri nets. Proc. CAAP'94. LNCS vol. 787 (1994), Springer 115-129
22. Esparza J. Decidability of model-checking for infinite-state concurrent systems. Acta Inform. 34 (1997) 85-107
23. van Glabbeek R., and Vaandrager F. Petri net models for algebraic theories of concurrency. Proc. PARLE'87. LNCS vol. 259 (1987), Springer 224-242
24. Goltz U. On representing CCS programs by finite Petri nets. Proc. MFCS'88. LNCS vol. 324 (1988), Springer 339-350
25. Goltz U. CCS and Petri Nets. LNCS Vol. 469 (1990), Springer pp. 334-357
26. Goltz U., and Rensink A. Finite Petri nets as models for recursive causal behaviour. Theoret. Comput. Sci. 124 1 (1994) 169-179
27. Gorrieri R., and Montanari U. SCONE: a simple calculus of nets. Proc. CONCUR'90. LNCS vol. 458 (1990), Springer 2-30
28. Gorrieri R., and Montanari U. On the implementation of concurrent calculi in net calculi: two case studies. Theoret. Comput. Sci. 141 1-2 (1995) 195-252
29. Hack M. The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems. Proc. 15th Ann. Symp. on Switching and Automata Theory (1974), IEEE
30. M. Hack, Petri Net Languages, Technical Report 159, MIT, 1976.
31. Janicki R., and Koutny M. Semantics of inhibitor nets. Inform. Comput. 123 (1995) 1-16
32. Jategaonkar Jagadeesan L., and Jagadeesan R. Causality and true concurrency: a data-flow analysis of the pi-calculus. Proc. AMAST'95. LNCS vol. 936 (1995), Springer 277-291
33. Karp R.M., and Miller R.E. Parallel program schemata. J. Comput. Syst. Sci. 3 2 (1969) 147-195
34. Kosaraju S.R. Decidability of reachability in vector addition systems. Proc. 6th ACM STOC (1982), ACM Press 267-281
35. Kozen D. Results on the propositional mu-calculus. Theoret. Comput. Sci. 27 (1983) 333-354
36. Mayr E.W. An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13 (1984) 441-460
37. R. Meyer, A theory of structural stationarity in the π-calculus, Acta Inform., in press.
38. R. Meyer, On boundedness in depth in the π-calculus, in: Proc. 5th IFIP International Conference on Theoretical Computer Science, in press.
39. Meyer R., Khomenko V., and Strazny T. A practical approach to verification of mobile systems using net unfoldings. Proc. ATPN'08. LNCS vol. 5062 (2008) 327-347
40. Milner R. Communication and Concurrency (1989), Prentice-Hall
41. R. Milner, The Polyadic π-Calculus: A Tutorial, Technical Report, Department of Computer Science, University of Edinburgh, ECS-LFCS-91-180, October 1991.
42. Milner R., Parrow J., and Walker D. A calculus of mobile processes. Inform. Comput. 100 1 (1992) 1-77
43. Montanari U., and Pistore M. Concurrent Semantics for the π-calculus. Proc. MFPS'95. ENTCS vol. 1 (1995), Elsevier
44. Montanari U., and Pistore M. Minimal transition systems for history-preserving bisimulation. Proc. STACS'95. LNCS vol. 1200 (1997), Springer 413-425
45. Montanari U., and Rossi F. Contextual nets. Acta Inform. 32 (1995) 545-596
46. Olderog E.R. Nets, terms and formulas. Cambridge Tracts Theoret. Comput. Sci. 23 (1991) CUP
47. Rabinovich A., and Trakhtenbrot B.A. Behaviour structures and nets. Fund. Inform. 11 (1988) 357-404
48. Reisig W. Petri nets: an introduction. EATCS Monographs on Theoretical Computer Science (1985), Springer-Verlag
49. Sangiorgi D., and Walker D. The π-Calculus: A Theory of Mobile Processes (2001), Cambridge University Press
50. Vogler W. Partial order semantics and read arcs. Proc. MFCS'97. LNCS vol. 1295 (1997), Springer 508-517