Skip to main content
SpringerLink
Log in

A Programming Language for Spatial Distribution of Net Systems

  • Conference paper
Application and Theory of Petri Nets and Concurrency (PETRI NETS 2014)

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

Abstract

Petri nets famously expose concurrency directly in their statespace. Building on the work on the compositional algebra of nets with boundaries, we show how an algebraic decomposition allows one to expose both concurrency and spatial distribution in the statespace.

Concretely, we introduce a high-level domain specific language (DSL), PNBml, for the construction of nets in terms of their components. We use PNBml to express several well-known parametric examples.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdulla, P.A., Iyer, S.P., Nylén, A.: SAT-Solving the Coverability Problem for Petri Nets. Formal Methods in System Design 24(1), 25–43 (2004)

    Article  Google Scholar 

  2. Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: LiCS 2004. IEEE Press (2004)

    Google Scholar 

  3. Arnold, A.: Nivat’s processes and their synchronization. TCS 281(1-2), 31–26 (2002)

    Article  MathSciNet  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. Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Springer (2001)

    Google Scholar 

  6. Bruni, R., Melgratti, H., Montanari, U.: A connector algebra for P/T nets interactions. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 312–326. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Bruni, R., Melgratti, H.C., Montanari, U., Sobociński, P.: Connector algebras for C/E and P/T nets’ interactions. Log. Meth. Comput. Sci. 9(3:16), 1–65 (2013)

    Google Scholar 

  8. Christensen, S., Hansen, N.D.: Coloured Petri Nets Extended With Place Capacities, Test Arcs and Inhibitor Arcs. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol. 691, pp. 186–205. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  9. Corbett, J.C.: Evaluating Deadlock Detection Methods for Concurrent Software. IEEE Transactions on Software Engineering 22(3), 161–180 (1996)

    Article  Google Scholar 

  10. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)

    Google Scholar 

  11. Junker, B.H., Schreiber, F.: Analysis of Biological Networks. Wiley (2008)

    Google Scholar 

  12. Katis, P., Sabadini, N., Walters, R.F.C.: Span (Graph): A Categorical Algebra of Transition Systems. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 307–321. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  13. Kennedy, A.: Relational Parametricity and Units of Measure. In: POPL 1997, pp. 442–455. ACM (1997)

    Google Scholar 

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

  15. Koch, I.: Petri nets - a mathematical formalism to analyze chemical reaction networks. Molecular Informatics 29(12), 838–843 (2010)

    Article  Google Scholar 

  16. Lafont, Y.: Towards an algebraic theory of boolean circuits. J. Pure. Appl. Alg. 184, 257–310 (2003)

    Article  MathSciNet  Google Scholar 

  17. Mazurkiewicz, A.: Compositional semantics of pure place/transition systems. In: Rozenberg, G. (ed.) APN 1988. LNCS, vol. 340, pp. 307–330. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  18. McMillan, K.: A technique of a state space search based on unfolding. Form. Method Syst. Des. 6(1), 45–65 (1995)

    Article  Google Scholar 

  19. Milner, R.: A Calculus of Communicating Systems. Prentice Hall (1989)

    Google Scholar 

  20. Petri, C.A.: Communication with automata. Technical report, Air Force Systems Command, Griffiss Air Force Base, New York (1966)

    Google Scholar 

  21. Rathke, J., Sobociński, P., Stephens, O.: Decomposing Petri nets. arXiv:1304.3121v1 (2013)

    Google Scholar 

  22. Reisig, W.: Simple composition of nets. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 23–42. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  23. Rutten, J.: A tutorial on coinductive stream calculus and signal flow graphs. Theor. Comput. Sci. 343(3), 443–481 (2005)

    Article  MathSciNet  Google Scholar 

  24. Schmidt, K.: How to calculate symmetries of Petri nets. Acta. Inf. 36, 545–590 (2000)

    Article  MathSciNet  Google Scholar 

  25. Sobociński, P.: Representations of Petri net interactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 554–568. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  26. Sobociński, P., Stephens, O.: Penrose: Putting Compositionality to Work for Petri Net Reachability. In: Heckel, R. (ed.) CALCO 2013. LNCS, vol. 8089, pp. 346–352. Springer, Heidelberg (2013)

    Google Scholar 

  27. Sobociński, P., Stephens, O.: Reachability via compositionality in Petri nets. arXiv:1303.1399v1 (2013)

    Google Scholar 

  28. van der Aalst, W.: Process Mining: Discovery, Conformance and Enhancement of Business Processes. Springer (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ECS, University of Southampton, UK

    Paweł Sobociński & Owen Stephens

Authors
  1. Paweł Sobociński
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Owen Stephens
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Iowa State University, 226 Atanasoff Hall, 50011, Ames, IA, USA

    Gianfranco Ciardo

  2. DTU Compute, Technical University of Denmark, Richard Pedersens Plads, 2800 Kgs., Lyngby, Denmark

    Ekkart Kindler

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sobociński, P., Stephens, O. (2014). A Programming Language for Spatial Distribution of Net Systems. In: Ciardo, G., Kindler, E. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2014. Lecture Notes in Computer Science, vol 8489. Springer, Cham. https://doi.org/10.1007/978-3-319-07734-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07734-5_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07733-8

  • Online ISBN: 978-3-319-07734-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation