Encoding Synchronous Interactions Using Labelled Petri Nets

We present an encoding of bound CSP processes with replication into Petri nets with labelled transitions. Through the encoding, the firing semantics of Petri nets models the standard operational semantics of CSP processes, which is both preserved and reflected. This correspondence allows for describing by net semantics the standard CSP observational equivalences. Since the encoding is modular with respect to process syntax, the paper puts on a firm ground the technology transfer between the two formalisms, e.g. recasting into the CSP framework well-established results like decidability of coverability for nets. This work complements previous results concerning the encoding of asynchronous interactions, thus witnessing the expressiveness of open labelled nets in modelling process calculi with alternative communication patterns.

[1]  Fabio Gadducci,et al.  Encoding Asynchronous Interactions Using Open Petri Nets , 2009, CONCUR.

[2]  Roberto Gorrieri,et al.  SCONE: A Simple Calculus of Nets , 1990, CONCUR.

[3]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[4]  Alexander Kurz,et al.  Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings , 2009, CALCO.

[5]  Mario Bravetti,et al.  CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings , 2009, CONCUR.

[6]  Maciej Koutny,et al.  A compositional Petri net translation of general π-calculus terms , 2008, Formal Aspects of Computing.

[7]  Gianfranco Balbo,et al.  Application and Theory of Petri Nets 1997 , 1997 .

[8]  Salvador Tamarit,et al.  Generating a Petri net from a CSP specification: A semantics-based method , 2012, Adv. Eng. Softw..

[9]  Vladimiro Sassone,et al.  Characterizing Behavioural Congruences for Petri Nets , 1995, CONCUR.

[10]  Maurizio Gabbrielli,et al.  Comparing Recursion, Replication, and Iteration in Process Calculi , 2004, ICALP.

[11]  Grzegorz Rozenberg.  Advances in Petri Nets 1992 , 1992, Lecture Notes in Computer Science.

[12]  Yoram Hirshfeld,et al.  Petri Nets and the Equivalence Problem , 1993, CSL.

[13]  Reiko Heckel,et al.  Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets , 2007, CALCO.

[14]  Insup Lee,et al.  CONCUR '95: Concurrency Theory , 1995, Lecture Notes in Computer Science.

[15]  Guillem Godoy,et al.  Decidable classes of tree automata mixing local and global constraints modulo flat theories , 2013 .

[16]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[17]  Ernst-Rüdiger Olderog,et al.  Operational Petri net semantics for CCSP , 1986, European Workshop on Applications and Theory of Petri Nets.

[18]  Grzegorz Rozenberg.  Advances in Petri Nets 1984 , 1985, Lecture Notes in Computer Science.

[19]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1988 , 1987, Lecture Notes in Computer Science.

[20]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[21]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[22]  Roberto Gorrieri,et al.  An Exercise in Concurrency: a CSP Process as a Condition/ event System , 1988, European Workshop on Applications and Theory of Petri Nets.

[23]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[24]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[25]  Grzegorz Rozenberg.  Advances in Petri Nets 1987 , 1986, Lecture Notes in Computer Science.

[26]  Wolfgang Reisig,et al.  Understanding Petri nets , 1995, IEEE Parallel & Distributed Technology: Systems & Applications.

[27]  Ekkart Kindler,et al.  A Compositional Partial Order Semantics for Petri Net Components , 1997, ICATPN.

[28]  Wolfgang Reisig,et al.  CSP-programs with individual tokens , 1984, European Workshop on Applications and Theory in Petri Nets.

[29]  Roberto Bruni,et al.  Connector algebras for C/E and P/T nets' interactions , 2013, Log. Methods Comput. Sci..