Skip to main content
SpringerLink
Log in

Encoding Asynchronous Interactions Using Open Petri Nets

  • Conference paper
CONCUR 2009 - Concurrency Theory (CONCUR 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5710))

Included in the following conference series:

Abstract

We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open places. The standard token game of nets models the reduction semantics of the calculus; the exchange of tokens on open places models the interactions between processes and their environment. The encoding preserves strong and weak CCS asynchronous bisimilarities: it thus represents a relevant step in establishing a precise correspondence between asynchronous calculi and (open) Petri nets. The work is intended as fostering the technology transfer between these formalisms: as an example, we discuss how some results on expressiveness can be transferred from the calculus to nets and back.

Partly supported by the EU FP6-IST IP 16004 SEnSOria and carried out during the second author’s tenure of an ERCIM “Alain Bensoussa” Fellowship Programme.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  2. Boudol, G.: Asynchrony and the π-calculus. Technical Report 1702, INRIA, Sophia Antipolis (1992)

    Google Scholar 

  3. De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A kernel language for agents interaction and mobility. IEEE Trans. Software Eng. 24(5), 315–330 (1998)

    Article  Google Scholar 

  4. Castellani, I., Hennessy, M.: Testing theories for asynchronous languages. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 90–102. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Ferrari, G., Guanciale, R., Strollo, D.: Event based service coordination over dynamic and heterogeneous networks. In: Dan, A., Lamersdorf, W. (eds.) ICSOC 2006. LNCS, vol. 4294, pp. 453–458. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Amadio, R., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous pi-calculus. TCS 195(2), 291–324 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Boreale, M., De Nicola, R., Pugliese, R.: Asynchronous observations of processes. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 95–109. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Boreale, M., De Nicola, R., Pugliese, R.: A theory of “may” testing for asynchronous languages. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 165–179. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Rathke, J., Sobocinski, P.: Making the unobservable, unobservable. In: ICE 2008. ENTCS. Elsevier, Amsterdam (2009) (to appear)

    Google Scholar 

  10. Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985)

    Book  MATH  Google Scholar 

  11. van der Aalst, W.: Pi calculus versus Petri nets: Let us eat “humble pie” rather than further inflate the “Pi hype”. BPTrends 3(5), 1–11 (2005)

    Google Scholar 

  12. Goltz, U.: CCS and Petri nets. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 334–357. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  13. 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–31. Springer, Heidelberg (1990)

    Google Scholar 

  14. Busi, N., Gorrieri, R.: A Petri net semantics for pi-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 145–159. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  15. Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general pi-calculus terms. Formal Asp. Comput. 20(4-5), 429–450 (2008)

    Article  MATH  Google Scholar 

  16. Aranda, J., Valencia, F., Versari, C.: On the expressive power of restriction and priorities in CCS with replication. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 242–256. Springer, Heidelberg (2009)

    Google Scholar 

  17. Olderog, E.: Nets, terms and formulas. Cambridge University Press, Cambridge (1991)

    Book  MATH  Google Scholar 

  18. Busi, N., Gorrieri, R.: Distributed semantics for the π-calculus based on Petri nets with inhibitor arcs. Journal of Logic and Algebraic Programming 78, 138–162 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Berry, G., Boudol, G.: The chemical abstract machine. TCS 96, 217–248 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  20. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  21. Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional semantics for open Petri nets based on deterministic processes. Mathematical Structures in Computer Science 15(1), 1–35 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  22. Milner, R.: Bigraphs for Petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 686–701. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  23. Sassone, V., Sobociński, P.: A congruence for Petri nets. In: Ehrig, H., Padberg, J., Rozenberg, G. (eds.) PNGT 2004. ENTCS, vol. 127, pp. 107–120. Elsevier, Amsterdam (2005)

    Google Scholar 

  24. Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  25. 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)

    Chapter  Google Scholar 

  26. Koutny, M., Esparza, J., Best, E.: Operational semantics for the Petri box calculus. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 210–225. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  27. 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)

    Chapter  Google Scholar 

  28. 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)

    Chapter  Google Scholar 

  29. Jancar, P.: Undecidability of bisimilarity for Petri nets and some related problems. TCS 148(2), 281–301 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  30. Buscemi, M., Sassone, V.: High-level Petri nets as type theories in the join calculus. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 104–120. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  31. Busi, N., Zavattaro, G.: A process algebraic view of shared dataspace coordination. J. Log. Algebr. Program. 75(1), 52–85 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  32. Devillers, R., Klaudel, H., Koutny, M.: A Petri net semantics of a simple process algebra for mobility. In: Baeten, J., Phillips, I. (eds.) EXPRESS 2005. ENTCS, vol. 154, pp. 71–94. Elsevier, Amsterdam (2006)

    Google Scholar 

  33. Meyer, R., Khomenko, V., Strazny, T.: A practical approach to verification of mobile systems using net unfoldings. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 327–347. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  34. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    Book  MATH  Google Scholar 

  35. Sangiorgi, D.: On the bisimulation proof method. Mathematical Structures in Computer Science 8(5), 447–479 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  36. Gadducci, F.: Graph rewriting and the π-calculus. Mathematical Structures in Computer Science 17, 1–31 (2007)

    Article  MathSciNet  Google Scholar 

  37. Milner, R.: Pure bigraphs: Structure and dynamics. Information and Computation 204, 60–122 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  38. Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Journal Inform. Process. Cybernet. EIK 30(3), 143–160 (1994)

    MATH  Google Scholar 

  39. Agerwala, T., Flynn, M.: Comments on capabilities, limitations and “correctness” of Petri nets. Computer Architecture News 4(2), 81–86 (1973)

    Article  Google Scholar 

  40. Busi, N., Zavattaro, G.: Expired data collection in shared dataspaces. TCS 3(298), 529–556 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica Pura e Applicata, Università di Padova, Italy

    Paolo Baldan

  2. Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands

    Filippo Bonchi

  3. Dipartimento di Informatica, Università di Pisa, Italy

    Filippo Bonchi & Fabio Gadducci

Authors
  1. Paolo Baldan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Filippo Bonchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fabio Gadducci
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Bologna, Mura A. Zamboni 7, 40127, Bologna, Italy

    Mario Bravetti  & Gianluigi Zavattaro  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baldan, P., Bonchi, F., Gadducci, F. (2009). Encoding Asynchronous Interactions Using Open Petri Nets. In: Bravetti, M., Zavattaro, G. (eds) CONCUR 2009 - Concurrency Theory. CONCUR 2009. Lecture Notes in Computer Science, vol 5710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04081-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04081-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04080-1

  • Online ISBN: 978-3-642-04081-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation