Skip to main content
SpringerLink
Log in

Language Representability of Finite P/T Nets

  • Chapter
  • First Online:
Programming Languages with Applications to Biology and Security

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

Abstract

Finite-net Multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, together with parallel composition, also multi-party synchronization. This calculus is equipped with a labeled transition system semantics and also with an unsafe P/T Petri net semantics, which is sound w.r.t. the transition system semantics. For any process p of the calculus, the net associated to p by the semantics has always a finite number of places, but it has a finite number of transitions only for so-called well-formed processes. The main result of the paper is that well-formed finite-net Multi-CCS processes are able to represent all finite, statically reduced, P/T Petri nets.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Institutional subscriptions

References

  1. Busi, N., Gorrieri, R.: Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor arcs. J. Logic Algebraic Program. 78(3), 138–162 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in TCS, vol. 50. Cambridge University Press, Cambridge (2010)

    MATH  Google Scholar 

  3. Desel, J., Reisig, W.: Place/transition Petri nets. In: [22], pp. 122–173 (1998)

    Google Scholar 

  4. Degano, P., De Nicola, R., Montanari, U.: A distributed operational semantics for CCS based on C/E systems. Acta Informatica 26(1–2), 59–91 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  5. Degano, P., De Nicola, R., Montanari, U.: Partial orderings descriptions and observations of nondeterministic concurrent processes. In: de Roever, W.-P., Rozenberg, G., de Bakker, J.W. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, pp. 438–466. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  7. Degano, P., Meseguer, J., Montanari, U.: Axiomatizing the algebra of net computations and processes. Acta Informatica 33(7), 641–667 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Esparza, J.: Decidability and complexity of Petri net problems: an introduction. In: [22], pp. 374–428 (1998)

    Google Scholar 

  9. Goltz, U.: On representing CCS programs by finite Petri nets. In: Janiga, L., Chytil, M.P., Koubek, V. (eds.) MFCS 1988. LNCS, vol. 324, pp. 339–350. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  10. Gorrieri, R., Montanari, U.: SCONE: a simple calculus of nets. In: Klop, J.W., Baeten, J.C.M. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 2–30. Springer, Heidelberg (1990)

    Google Scholar 

  11. Gorrieri, R., Montanari, U.: Towards hierarchical specification of systems: a proof system for strong prefixing. Int. J. Found. Comput. Sci. 1(3), 277–293 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gorrieri, R., Marchetti, S., Montanari, U.: A\(^2\)CCS: atomic actions for CCS. Theor. Comput. Sci. 72(2–3), 203–223 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gorrieri, R., Versari, C.: A process calculus for expressing finite place/transition Petri Nets. In: Proceedings of the EXPRESS 2010. EPTCS (2010). doi:10.4204/EPTCS.41.6, arXiv:1011.6433v1

  14. Gorrieri, R., Versari, C.: Introduction to Concurrency Theory: Transition Systems and CCS. EATCS Text in Computer Science. Springer (2015)

    Google Scholar 

  15. Gorrieri, R.: Language representability of finite place/transition Petri Nets. www.cs.unibo.it/gorrieri/papers.html

  16. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  17. Mayr, R.: Process rewrite systems. Inf. Comput. 156(1–2), 264–286 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  19. Olderog, E.R.: Nets, Terms and Formulas. Cambridge Tracts in TCS, vol. 23. Cambridge University Press, Cambridge (1991)

    Book  MATH  Google Scholar 

  20. Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs (1981)

    MATH  Google Scholar 

  21. Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on TCS. Springer, Heidelberg (1985)

    Book  MATH  Google Scholar 

  22. Reisig, W., Rozenberg, G. (eds.): APN 1998. LNCS, vol. 1491. Springer, Heidelberg (1998)

    MATH  Google Scholar 

Download references

Acknowledgment

Massimo Morara is thanked for pointing out the inaccuracy in the definition of the process \(INet(N(m_0))\) in [13]. The anonymous referees are thanked for their comments, which will be considered for the full version [15].

Author information

Authors and Affiliations

  1. Dipartimento di Informatica — Scienza e Ingegneria, Università di Bologna, Mura A. Zamboni, 7, 40127, Bologna, Italy

    Roberto Gorrieri

Authors
  1. Roberto Gorrieri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roberto Gorrieri .

Editor information

Editors and Affiliations

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

    Chiara Bodei

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

    Gianluigi Ferrari

  3. Università degli Studi di Trento, Povo, Italy

    Corrado Priami

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Gorrieri, R. (2015). Language Representability of Finite P/T Nets. In: Bodei, C., Ferrari, G., Priami, C. (eds) Programming Languages with Applications to Biology and Security. Lecture Notes in Computer Science(), vol 9465. Springer, Cham. https://doi.org/10.1007/978-3-319-25527-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25527-9_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25526-2

  • Online ISBN: 978-3-319-25527-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation