Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2012: CONCUR 2012 – Concurrency Theory pp 440–455Cite as

A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets

  • Conference paper

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

Abstract

We develop a polynomial translation from finite control processes (an important fragment of π-calculus) to safe low-level Petri nets. To our knowledge, this is the first such translation. It is natural (there is a close correspondence between the control flow of the original specification and the resulting Petri net), enjoys a bisimulation result, and it is suitable for practical model checking.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amadio, R., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous π-calculus. Nord. J. Comp. 9(1), 70–101 (2002)

    MathSciNet  MATH  Google Scholar 

  2. Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Monographs in Theoretical Computer Science. An EATCS Series. Springer (2001)

    Google Scholar 

  3. Busi, N., Gorrieri, R.: Distributed semantics for the π-calculus based on Petri nets with inhibitor arcs. J. Log. Alg. Prog. 78(1), 138–162 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dam, M.: Model checking mobile processes. Inf. Comp. 129(1), 35–51 (1996)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Esparza, J.: Decidability and Complexity of Petri Net Problems—An Introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 374–428. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Ferrari, G.-L., Gnesi, S., Montanari, U., Pistore, M.: A model-checking verification environment for mobile processes. ACM Trans. Softw. Eng. Methodol. 12(4), 440–473 (2003)

    Article  Google Scholar 

  8. Khomenko, V., Koutny, M., Niaouris, A.: Applying Petri net unfoldings for verification of mobile systems. In: Proc. of MOCA, Bericht FBI-HH-B-267/06, pp. 161–178. University of Hamburg (2006)

    Google Scholar 

  9. Khomenko, V., Meyer, R.: Checking π-calculus structural congruence is graph isomorphism complete. In: Proc. of ACSD, pp. 70–79. IEEE Computer Society Press (2009)

    Google Scholar 

  10. Meyer, R.: On Boundedness in Depth in the π-Calculus. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds.) IFIP TCS 2008. IFIP, vol. 273, pp. 477–489. Springer, Boston (2008)

    Google Scholar 

  11. Meyer, R.: A theory of structural stationarity in the π-calculus. Acta Inf. 46(2), 87–137 (2009)

    Article  MATH  Google Scholar 

  12. Meyer, R., Gorrieri, R.: On the Relationship between π-Calculus and Finite Place/Transition Petri Nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 463–480. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Meyer, R., Khomenko, V., Hüchting, R.: A polynomial translation of π-calculus (FCP) to safe Petri nets. Technical Report CS-TR-1323, Newcastle Univ. (2012)

    Google Scholar 

  14. Meyer, R., Khomenko, V., Strazny, T.: A practical approach to verification of mobile systems using net unfoldings. Fundam. Inf. 94, 439–471 (2009)

    MathSciNet  MATH  Google Scholar 

  15. Milner, R.: Communicating and Mobile Systems: the π-Calculus. CUP (1999)

    Google Scholar 

  16. Montanari, U., Pistore, M.: Checking Bisimilarity for Finitary π-Calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 42–56. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  17. Orava, F., Parrow, J.: An algebraic verification of a mobile network. For. Asp. Comp. 4(6), 497–543 (1992)

    Article  MATH  Google Scholar 

  18. Peschanski, F., Klaudel, H., Devillers, R.: A Petri Net Interpretation of Open Reconfigurable Systems. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 208–227. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  19. Pistore, M.: History Dependent Automata. PhD thesis, Dipartimento di Informatica, Università di Pisa (1999)

    Google Scholar 

  20. Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. CUP (2001)

    Google Scholar 

  21. Victor, B., Moller, F.: The Mobility Workbench: A Tool for the π-Calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 428–440. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Kaiserslautern, Germany

    Roland Meyer & Reiner Hüchting

  2. Newcastle University, UK

    Victor Khomenko

Authors
  1. Roland Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Khomenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Reiner Hüchting
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Newcastle University, Claremont Tower, Claremont Road, NE1 7RU, Newcastle upon Tyne, UK

    Maciej Koutny

  2. Department of Computer Science, University of Leicester, Computer Science Building, University Road, LE1 7RH, Leicester, UK

    Irek Ulidowski

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meyer, R., Khomenko, V., Hüchting, R. (2012). A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets. In: Koutny, M., Ulidowski, I. (eds) CONCUR 2012 – Concurrency Theory. CONCUR 2012. Lecture Notes in Computer Science, vol 7454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32940-1_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32940-1_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32939-5

  • Online ISBN: 978-3-642-32940-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation