Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3393))

  • 655 Accesses

Abstract

In this paper, we propose a new,loose semantics for place/tran- sition nets based on transition systems and generalizing the reachability graph semantics. The loose semantics of a place/transition net reflects all its possible refinements and is given as a category of transition systems with alternative sequences of events over the net. The main result states that each plain morphism between two place/transitions nets induces a free construction between the corresponding semantic categories.

Research partially supported by the EC Research Training Network SegraVis.

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

Access this chapter

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. Bernadinello, L., De Cindio, F.: A survey of basic net models and modular net classes. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol. 609, pp. 304–351. Springer, Heidelberg (1992)

    Google Scholar 

  2. Best, E., Desel, J.: Partial order behaviour and structure of Petri nets. Formal Aspects of Computing, 123–138 (1990)

    Google Scholar 

  3. Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Rossi, F.: An event structure semantics for safe graph grammars. In: Proc. PROCOMET 1994, IFIP TC2 Working Conf., San Miniato, pp. 417–439. IFIP TCS (1994)

    Google Scholar 

  4. Christensen, S., Petrucci, L.: Modular analysis of Petri nets. Computer Journal 43(3), 224–242 (2000)

    Article  MATH  Google Scholar 

  5. Desel, J., Juhás, G., Lorenz, R.: Petri Nets over Partial Algebras. In: Ehrig, H., Juhás, G., Padberg, J., Rozenberg, G. (eds.) APN 2001. LNCS, vol. 2128, p. 126. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Desel, J., Reisig, W.: Place/transition Petri nets. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 122–173. Springer, Heidelberg (1998)

    Google Scholar 

  7. Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 2: Module Specifications and Constraints. EATCS Monographs on Theoretical Computer Science, vol. 21. Springer, Berlin (1990)

    MATH  Google Scholar 

  8. Ehrig, H., Orejas, F., Braatz, B., Klein, M., Piirainen, M.: A Generic Component Concept for System Modelling. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 33–48. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Huber, P., Jensen, K., Shapiro, R.M.: Hierarchies in Coloured Petri Nets. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483, pp. 313–341. Springer, Heidelberg (1991)

    Google Scholar 

  10. Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: A trace semantics for Petri nets. Information and Computation 117(1), 98–114 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Juhás, G., Lorenz, R.: Modelling with Petri modules. In: Caillaud, B., Xie, X., Darondeau, L., Lavagno, P. (eds.) Synthesis and Control of Discrete Event Systems, pp. 125–138. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

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

    Google Scholar 

  13. Mazurkiewicz, A.: Basic notions of trace theory. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, pp. 285–363. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  14. Meseguer, J., Montanari, U.: Petri Nets are Monoids. Information and Computation 88(2), 105–155 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  15. Morin, R., Rozoy, B.: On the semantics of place/transition nets. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 447–462. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  16. Müller, H., Weber, H. (eds.): Continuous Engineering of Industrial Scale Software Systems. IBFI, Schloß Dagstuhl, Dagstuhl Seminar Report #98092 (1998)

    Google Scholar 

  17. Nielsen, M., Plotkin, G., Winskel, G.: Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science 13, 85–108 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  18. Nielsen, M., Sassone, V.: Petri nets and other models of concurrency. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 587–642. Springer, Heidelberg (1998)

    Google Scholar 

  19. Nielsen, M., Sassone, V., Winskel, G.: Relationships Beween Models of Concurrency. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 425–476. Springer, Heidelberg (1994)

    Google Scholar 

  20. Padberg, J.: Petri net modules. Journal on Integrated Design and Process Technology 6(4), 105–120 (2002)

    Google Scholar 

  21. Padberg, J.: Transition systems with alternatives: an approach to a loose semantics of place/transition nets. Technical Report 2003-18, Technical University Berlin (2003)

    Google Scholar 

  22. Padberg, J., Ehrig, H.: Petri net modules in the transformation-based component framework. Journal of Logic and Algebraic Programming (2003) (submitted)

    Google Scholar 

  23. Reisig, W.: Petri Nets. EATCS Monographs on Theoretical Computer Science, vol. 4. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  24. Reichel, H.: Specification semantics. In: Astesiano, E., Kreowski, H.-J., Krieg–Brückner, B. (eds.) Algebraic Foundations of System Specification, IFIP State–of– the–Art Reports, ch. 5, pp. 131–158. Springer, Heidelberg (1999)

    Google Scholar 

  25. Rozoy, B.: On distributed languages and models for concurrency. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol. 609, pp. 267–291. Springer, Heidelberg (1992)

    Google Scholar 

  26. Weber, H.: Continuous engineering of information and communication infrastructures. In: Finance, J.-P. (ed.) FASE 1999. LNCS, vol. 1577, pp. 22–29. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Padberg, J., Kreowski, HJ. (2005). Loose Semantics of Petri Nets. In: Kreowski, HJ., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds) Formal Methods in Software and Systems Modeling. Lecture Notes in Computer Science, vol 3393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31847-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31847-7_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24936-8

  • Online ISBN: 978-3-540-31847-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics