Skip to main content
SpringerLink
Log in

A compositional Petri net translation of general π-calculus terms

  • Original Article
  • Published:
Formal Aspects of Computing

Abstract

We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. This is achieved by using high-level nets together with an equivalence on markings in order to model entering into recursive calls, which do not need to be guarded. We view a computing system as consisting of a main program (π-calculus term) together with procedure declarations (recursive definitions of π-calculus identifiers). The control structure of these components is represented using disjoint high-level Petri nets, one for the main program and one for each of the procedure declarations. The program is executed once, while each procedure can be invoked several times (even concurrently), each such invocation being uniquely identified by structured tokens which correspond to the sequence of recursive calls along the execution path leading to that invocation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Best E, Devillers R, Koutny M (2001) Petri net algebra. EATCS Monogr TCS, Springer, Heidelberg

    Google Scholar 

  2. Best E, Devillers R (1988) Sequential and concurrent behaviour in Petri net theory. Theor Comput Sci 55: 87–136

    Article  MathSciNet  Google Scholar 

  3. Best E, Fraczak W, Hopkins RP, Klaudel H, Pelz E (1998) M-nets: an algebra of high level Petri nets, with an application to the semantics of concurrent programming languages. Acta Inf 35: 813–857

    Article  MATH  MathSciNet  Google Scholar 

  4. Boreale M, Sangiorgi D (1995) A fully abstract semantics for causality in the π-calculus. In: Proceedings of STACS 1995. Springer, Heidelberg, LNCS, vol 900, pp 243–254

  5. Busi N, Gorrieri R (1995) A Petri net semantics for π-calculus. In: Proceedings of CONCUR 1995, LNCS, vol 962, pp 145–159

  6. Cattani GL, Sewell P (2000) Models for name-passing processes: interleaving and causal. In: Proceedings of LICS 2000. IEEE CS Press, Los Alamitos, pp 322–333

  7. Cattani GL, Sewell P (2000) Models for name-passing processes: interleaving and causal. Technical report TR-505, University of Cambridge, Cambridge

  8. Christensen S, Hansen ND (1993) Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs. In: Proceedings of ICATPN 1993. Springer, Heidelberg, LNCS, vol 691, pp 186–205

  9. Devillers R, Klaudel H (2004) Solving Petri net recursions through finite representation. In: Proceedings of IASTED 2004. ACTA Press, New York, pp 145–150

  10. Devillers R, Klaudel H, Koutny M (2006) A Petri net semantics of a simple process algebra for mobility. Electr Notes Theor Comput Sci 154: 71–94

    Article  Google Scholar 

  11. Devillers R, Klaudel H, Koutny M (2006) Petri net semantics of the finite π-calculus terms. Fundam Inf 70: 1–24

    MathSciNet  Google Scholar 

  12. Devillers R, Klaudel H, Koutny M (2006) A Petri net translation of π-calculus terms. ICTAC 2006, LNCS, vol 4281, pp 138–152

  13. Devillers R, Klaudel H, Riemann R-C (2003) General parameterised refinement and recursion for the M-net calculus. Theor Comput Sci 300: 235–258

    Article  MathSciNet  Google Scholar 

  14. Devillers R, Klaudel H, Koutny M, Pommereau F (2003) Asynchronous box calculus. Fundam Inf 54: 295–344

    MATH  MathSciNet  Google Scholar 

  15. Engelfriet J (1996) A multiset semantics for the π-calculus with replication. Theor Comput Sci 153: 65–94

    Article  MATH  MathSciNet  Google Scholar 

  16. Grahlmann B, Best E (1996) PEP—more than a Petri net tool. In: Proceedings of TACAS 1996. Springer, Heidelberg, LNCS, vol 1055, pp 397–401

  17. Haddad S, Poitrenaud D (2000) Modelling and analyzing systems with recursive Petri nets. In: Proceedings of WODES 2000. Kluwer, Dordrecht, pp 449–458

  18. Khomenko V (2003) Model checking based on prefixes of Petri net unfoldings. Ph.D thesis, School of Computing Science, University of Newcastle

  19. Kiehn A (1990) Petri net systems and their closure properties. In: Rozenberg G (ed) Advances in Petri nets 1989. Springer, Heidelberg, LNCS, vol 424, pp 306–328

  20. Khomenko V, Koutny M, Niaouris A (2006) Applying Petri net unfoldings for verification of mobile systems. Technical report CS-TR-953, University of Newcastle. In: Post-proceedings of MOCA 2006 (to appear)

  21. Milner R (1989) Communication and concurrency. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

  22. Mobility Workbench. Uppsala Universitet. http://www.it.uu.se/research/group/mobility/mwb

  23. Montanari U, Pistore M (1995) Concurrent semantics for the π-calculus. In: Proceedings of MFPS 1995, Electronic notes in computer science, vol 1. Elsevier, Amsterdam, pp 1–19

  24. Montanari U, Pistore M (2001) History dependent automata. Technical report 0112-14, Instituto Trentino di Cultura

  25. Milner R, Parrow J, Walker D (1992) A calculus of mobile processes. Inf Comput 100: 1–77

    Article  MATH  MathSciNet  Google Scholar 

  26. Parrow J (2001) An introduction to the π-calculus. In: Bergstra J, Ponse A, Smolka S(eds) Handbook of Process algebra. Elsevier, Amsterdam, pp 479–543

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’Informatique, Université Libre de Bruxelles CP212, 1050, Brussels, Belgium

    Raymond Devillers

  2. IBISC, FRE 2873 CNRS, Université d’Evry Val d’Essonne, 91000, Evry, France

    Hanna Klaudel

  3. School of Computing Science, Newcastle University, Newcastle upon Tyne, NE1 7RU, UK

    Maciej Koutny

Authors
  1. Raymond Devillers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanna Klaudel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hanna Klaudel.

Additional information

Communicated by K. Barkaoui, M. Broy, A. Cavalcanti and A. Cerone

Rights and permissions

Reprints and permissions

About this article

Cite this article

Devillers, R., Klaudel, H. & Koutny, M. A compositional Petri net translation of general π-calculus terms. Form Asp Comp 20, 429–450 (2008). https://doi.org/10.1007/s00165-008-0079-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-008-0079-2

Keywords

Search

Navigation