Advertisement

Encoding Synchronous Interactions Using Labelled Petri Nets

  • Paolo Baldan
  • Filippo Bonchi
  • Fabio Gadducci
  • Giacoma V. Monreale
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8459)

Abstract

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.

Keywords

Communicating sequential processes (CSP) labelled Petri nets net encoding of processes synchronous interaction 

References

  1. 1.
    Baldan, P., Bonchi, F., Gadducci, F.: Encoding asynchronous interactions using open Petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 99–114. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Baldan, P., Corradini, A., Ehrig, H., Heckel, R., König, B.: Bisimilarity and behaviour-preserving reconfigurations of open Petri nets. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 126–142. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Best, E., Devillers, R., Hall, J.G.: The Petri box calculus: a new causal algebra with multi-label communication. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol. 609, pp. 21–69. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  4. 4.
    Bruni, R., Melgratti, H.C., Montanari, U., Sobocinski, P.: Connector algebras for C/E and P/T nets’ interactions. Logical Methods in Computer Science 9(3), 1–65 (2013)CrossRefMathSciNetGoogle Scholar
  5. 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)CrossRefGoogle Scholar
  6. 6.
    Degano, P., Gorrieri, R., Marchetti, S.: An exercise in concurrency: a CSP process as a condition/event system. In: Rozenberg, G. (ed.) APN 1988. LNCS, vol. 340, pp. 85–105. Springer, Heidelberg (1988)CrossRefGoogle Scholar
  7. 7.
    Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general pi-calculus terms. Formal Aspects of Computing 20(4-5), 429–450 (2008)CrossRefzbMATHGoogle Scholar
  8. 8.
    Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Elektronische Informationsverarbeitung und Kybernetik 30(3), 143–160 (1994)zbMATHGoogle Scholar
  9. 9.
    Goltz, U., Reisig, W.: CSP-programs with individual tokens. In: Rozenberg, G. (ed.) APN 1984. LNCS, vol. 188, pp. 169–196. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  10. 10.
    Gorrieri, R., Montanari, U.: SCONE: A simple calculus of nets. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 2–30. Springer, Heidelberg (1990)Google Scholar
  11. 11.
    Hirshfeld, Y.: Petri nets and the equivalence problem. In: Börger, E., Gurevich, Y., Meinke, K. (eds.) CSL 1993. LNCS, vol. 832, pp. 165–174. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  12. 12.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Upper Saddle River (1985)zbMATHGoogle Scholar
  13. 13.
    Kindler, E.: A compositional partial order semantics for Petri net components. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 235–252. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  14. 14.
    Llorens, M., Oliver, J., Silva, J., Tamarit, S.: Generating a Petri net from a CSP specification: A semantics-based method. Advances in Engineering Software 50, 110–130 (2012)CrossRefGoogle Scholar
  15. 15.
    Nielsen, M., Priese, L., Sassone, V.: Characterizing behavioural congruences for Petri nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 175–189. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  16. 16.
    Olderog, E.R.: Operational Petri net semantics for CCSP. In: Rozenberg, G. (ed.) APN 1987. LNCS, vol. 266, pp. 196–223. Springer, Heidelberg (1987)CrossRefGoogle Scholar
  17. 17.
    Reisig, W.: Understanding Petri Nets. Springer (2013)Google Scholar
  18. 18.
    Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall, Upper Saddle River (1998)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2014

Authors and Affiliations

  • Paolo Baldan
    • 1
  • Filippo Bonchi
    • 2
  • Fabio Gadducci
    • 3
  • Giacoma V. Monreale
    • 3
  1. 1.Dipartimento di MatematicaUniversità di PadovaPadovaItaly
  2. 2.LIP, ENS LyonUniversité de Lyon (UMR CNRS - INRIA 5668)LyonFrance
  3. 3.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations