Skip to main content

Representations of Petri Net Interactions

  • Conference paper

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

Abstract

We introduce a novel compositional algebra of Petri nets, as well as a stateful extension of the calculus of connectors. These two formalisms are shown to have the same expressive power.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S.: Abstract scalars, loops and free traced and strongly compact closed categories. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 1–29. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comp. Sci. 14(3), 1–38 (2004)

    Article  MathSciNet  Google Scholar 

  3. Arbab, F., Bruni, R., Clarke, D., Lanese, I., Montanari, U.: Tiles for Reo. In: WADT 2008. LNCS, vol. 5486. Springer, Heidelberg (2008)

    Google Scholar 

  4. Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional modelling of reactive systems using open nets. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 502–518. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional semantics for open Petri nets based on deterministic processes. Math. Struct. Comp. Sci. 15(1), 1–35 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Baldan, P., Corradini, A., Ehrig, H., Heckel, R., König, B.: Bisimilarity and behaviour-preserving reconfigurations of Petri nets. Log. Meth. Comput. Sci. 4(4), 1–41 (2008)

    Article  Google Scholar 

  7. Best, E., Devillers, R., Hall, J.G.: The box calculus: A new causal algebra with multi-labelled communication. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol. 609, pp. 21–69. Springer, Heidelberg (1992)

    Google Scholar 

  8. Bliudze, S., Sifakis, J.: A notion of glue expressiveness for component-based systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 508–522. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Bruni, R., Lanese, I., Montanari, U.: A basic algebra of stateless connectors. Theor. Comput. Sci. 366, 98–120 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  11. Cerone, A.: Implementing Condition/Event nets in the circal process algebra. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 49–63. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Degano, P., Nicola, R.D., Montanari, U.: A distributed operational semantics for CCS based on C/E systems. Acta Inform. 26, 59–91 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gadducci, F., Montanari, U.: The tile model. In: Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133–166. MIT Press, Cambridge (2000)

    Google Scholar 

  14. Goltz, U.: CCS and Petri nets. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469. Springer, Heidelberg (1990)

    Google Scholar 

  15. Groote, J.F., Voorhoeve, M.: Operational semantics for Petri net components. Theor. Comput. Sci. 379(1-2), 1–19 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Joyal, A., Street, R.: The geometry of tensor calculus, i. Adv. Math. 88, 55–112 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  17. Katis, P., Sabadini, N., Walters, R.F.C.: Representing P/T nets in Span(Graph). In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 307–321. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  18. Katis, P., Sabadini, N., Walters, R.F.C.: Span(Graph): an algebra of transition systems. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 322–336. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  19. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies, pp. 3–41. Princeton University Press, Princeton (1956)

    Google Scholar 

  20. 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 

  21. Leifer, J.J., Milner, R.: Transition systems, link graphs and Petri nets. Math. Struct. Comp. Sci. 16(6), 989–1047 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  22. McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IEEE Trans. Electronic Computers 9, 39–47 (1960)

    Article  Google Scholar 

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

    Google Scholar 

  24. 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 

  25. Montanari, U., Rossi, F.: Contextual nets. Acta Inform. 32(6), 545–596 (1995)

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  27. Plotkin, G.D.: A structural approach to operational semantics. J. Logic Algebr. Progr. 60-61, 17–139 (2004); Originally appeared as Technical Report DAIMI FN-19, University of Aarhus (1981)

    Article  MathSciNet  Google Scholar 

  28. Reisig, W.: Petri nets: an introduction. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  29. Sassone, V., Sobociński, P.: A congruence for Petri nets. In: Petri Nets and Graph Transformation (PNGT 2004). ENTCS, vol. 127, pp. 107–120 (2005)

    Google Scholar 

  30. Sobociński, P.: A non-interleaving process calculus for multi-party synchronisation. In: Interaction and Concurrency (ICE 2009). EPTCS, vol. 12 (2009)

    Google Scholar 

  31. van Glabbeek, R., Vaandrager, F.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259. Springer, Heidelberg (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sobociński, P. (2010). Representations of Petri Net Interactions. In: Gastin, P., Laroussinie, F. (eds) CONCUR 2010 - Concurrency Theory. CONCUR 2010. Lecture Notes in Computer Science, vol 6269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15375-4_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15375-4_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15374-7

  • Online ISBN: 978-3-642-15375-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics