Skip to main content
SpringerLink
Log in

Rewriting Logic as a Unifying Framework for Petri Nets

  • Chapter
  • First Online:
Unifying Petri Nets

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2128))

Abstract

We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by individual tokens, test arcs, and time. Based on the idea that “Petri nets are monoids” suggested by Meseguer and Montanari we define a rewriting semantics that maps place/transition nets into rewriting logic specifications. We furthermore generalize this result to a general form of algebraic net specifications subsuming also colored Petri nets as a special case. The soundness and completeness results we state relate the commutative process semantics of Petri nets proposed by Best and Devillers to the model-theoretic semantics of rewriting logic in the sense of natural isomorphisms between suitable functors. In addition we show how place/transition nets with test arcs and timed Petri nets can be equipped with a rewriting semantics and discuss how other extensions can be treated along similar lines. Beyond the conceptual unification of quite different kinds of Petri nets within a single framework, the rewriting semantics can provide a guide for future extensions of Petri nets and help to cope with the growing diversity of models in this field. On the practical side, a major application of the rewriting semantics is its use as a logical and operational representation of Petri net models for formal verification and for the efficient execution and analysis using a rewriting engine such as Maude, which also allows us to specify different execution and analysis strategies in the same rewriting logic language by means of reflection.

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. W. M. P. van der Aalst. Interval timed coloured Petri nets and their analysis. In M. A. Marsan, editor, Application and Theory of Petri Nets 1993, volume 691 of Lecture Notes in Computer Science, pages 453–472. Springer, 1993.

    Google Scholar 

  2. N. A. Anisimov. An algebra of regular macronets for formal specification of communication protocols. Computers and Artificial Intelligence, 10(6):541–560, 1991.

    MATH  MathSciNet  Google Scholar 

  3. N. A. Anisimov, K. Kishinski, A. Miloslavski, and P. A. Postupalski. Macroplaces in high level Petri nets: Application for design inbound call center. In Proceedings of the Int. Conference on Information System Analysis and Synthesis (ISAS’96), Orlando, FL, USA, pages 153–160, July 1996.

    Google Scholar 

  4. A. Asperti. A logic for concurrency. unpublished manuscript, November 1987.

    Google Scholar 

  5. E. Battiston, F. De Cindio, and G. Mauri. OBJSA nets: a class of high-level nets having objects as domains. In G. Rozenberg, editor, Advances in Petri Nets, volume 340 of Lecture Notes in Computer Science. Springer-Verlag, 1988.

    Google Scholar 

  6. B. Berthomieu, N. Choquet, C. Colin, B. Loyer, J. M. Martin, and A. Mauboussin. Abstract data nets: Combining Petri nets and abstract data types for high level specifications of distributed systems. In Proc. of the Seventh Workshop on Applications and Theory of Petri Nets, Oxford, UK, pages 25–48, 1986.

    Google Scholar 

  7. E. Best and R. Devillers. Sequential and concurrent behaviour in Petri net theory. Theoretical Computer Science, 55:87–136, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  8. E. Best and C. Fernandez. Nonsequential Processes—A Petri Net View, volume 13 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.

    Google Scholar 

  9. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. Theoretical Computer Science, 236:35–132, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  10. C. Brown. Relating Petri nets to formulae of linear logic. Technical Report ECS-LFCS-89-87, Laboratory of Foundations of Computer Science, University of Edinburgh, June 1989.

    Google Scholar 

  11. C. Brown and D. Gurr. A categorical linear framework for Petri nets. In Proc. Fifth Annual IEEE Symposium on Logic in Computer Science, pages 208–218, June 1990.

    Google Scholar 

  12. R. Bruni, J. Meseguer, U. Montanari, and V. Sassone. A comparison of Petri net semantics under the collective token philosophy. In J. Hsiang and A. Ohori, editors, Proceedings of ASIAN’98, 4th Asian Computing Science Conference, volume 1538 of Lecture Notes in Computer Science, pages 225–244. Springer-Verlag, 1998.

    Google Scholar 

  13. R. Bruni, J. Meseguer, U. Montanari, and V. Sassone. Functorial semantics for Petri nets under the individual token philosophy. In Proc. Category Theory and Computer Science, Edinburgh, Scottland, September 1999, volume 29 of Electronic Notes in Theoretical Computer Science. Elsevier, 1999. http://www.elsevier.nl/locate/entcs/volume29.html.

  14. R. Bruni, J. Meseguer, U. Montanari, and V. Sassone. Functorial semantics for petri nets under the individual token philosophy. In Electronic Notes in Theoretical Computer Science: Proceedings of CTCS’99, 8th Conference on Category Theory and Computer Science, volume 29, pages 1–19. Elsevier Science, 1999.

    MathSciNet  Google Scholar 

  15. R. Bruni and V. Sassone. Algebraic models for contextual nets. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, Automata, Languages and Programming. Proceedings 2000., volume 1853. Springer-Verlag, 2000.

    Google Scholar 

  16. S. Christensen and N. D. Hansen. Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs. In M. A. Marsan, editor, Application and Theory of Petri Nets 1993, volume 691 of Lecture Notes in Computer Science, 1993.

    Google Scholar 

  17. M. Clavel. Reflection in general logics and in rewriting logic, with applications to the Maude language. Ph.D. Thesis, University of Navarre, 1998.

    Google Scholar 

  18. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. A tutorial on Maude. SRI International, March 2000, http://maude.csl.sri.com.

  19. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Maude: Specification and Programming in Rewriting Logic. Computer Science Laboratory, SRI International, Menlo Park, 1999. http://maude.csl.sri.com.

    Google Scholar 

  20. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Towards Maude 2.0. In K. Futatsugi, editor, Third International Workshop on Rewriting Logic and its Applications (WRLA’2000), Kanazawa, Japan, September 18–20, 2000, volume 36 of Electronic Notes in Theoretical Computer Science, pages 297–318. Elsevier, 2000. http://www.elsevier.nl/locate/entcs/volume36.html.

  21. P. Degano, J. Meseguer, and U. Montanari. Axiomizing the algebra of net computations and processes. Acta Informatica, 33:641–667, 1996.

    Article  MathSciNet  Google Scholar 

  22. C. Dimitrovici, U. Hummert, and L. Petrucci. Semantics, composition and net properties of algebraic high-level nets. In G. Rozenberg, editor, Advances in Petri Nets 1991, volume 524 of Lecture Notes in Computer Science. Springer-Verlag, 1991.

    Chapter  Google Scholar 

  23. F. Durán and J. Meseguer. Structured theories and institutions. In M. Hofmann, G. Rosolini, and D. Pavlović, editors, Proceedings of CTCS’99, 8th Conference on Category Theory and Computer Science, Edinburgh, Scotland, U.K., September 10–12, 1999, volume 29, pages 71–90. Elsevier, 1999. http://www.elsevier.nl/locate/entcs/volume29.html.

  24. H. Ehrig and J. Padberg. Uniform approach to Petri nets. In C. Freksa, M. Jantzen, and R. Valk, editors, Foundations of Computer Science: Potential-Theory-Cognition, volume 1337 of Lecture Notes in Computer Science, pages 219–231. Springer-Verlag, August 1997.

    Google Scholar 

  25. H. Ehrig, J. Padberg, and L. Ribeiro. Algebraic high-level nets: Petri nets revisited. In Recent Trends in Data Type Specification, volume 785 of Springer-Verlag, pages 188–206, 1994.

    Google Scholar 

  26. U. Engberg and G. Winskel. Petri nets as models of linear logic. In A. Arnold, editor, CAAP’90, volume 431 of Lecture Notes in Computer Science, pages 147–161. Springer-Verlag, 1990.

    Google Scholar 

  27. J. Fanchon. FIFO-net models for processes with asynchronous communication. In G. Rozenberg, editor, Advances in Petri Nets 1992, volume 609 of Lecture Notes in Computer Science, pages 152–178. Springer-Verlag, 1992.

    Google Scholar 

  28. B. Farwer. A linear logic view of object Petri nets. Fundamenta Informaticae, 37(3):225–246, 1999.

    MATH  MathSciNet  Google Scholar 

  29. A. Finkel and A. Choquet. FIFO nets without order deadlock. Acta Informatica, 25(1):15–36, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  30. A. Finkel and G. Memmi. FIFO nets: New model of parallel computation. In 6th GI-Conference on Theoretical Computer Science, Dortmund, volume 145 of Lecture Notes in Computer Science, pages 111–121. Springer-Verlag, 1982.

    Google Scholar 

  31. H. J. Genrich. Equivalence transformation of PrT-nets. In G. Rozenberg, editor, Advances in Petri Nets 1989, volume 424, pages 179–208. Springer-Verlag, 1990.

    Google Scholar 

  32. H. J. Genrich. Predicate/transition nets. In High-Level Petri Nets: Theory and Practice, pages 3–43. Springer-Verlag, 1991.

    Google Scholar 

  33. H. J. Genrich and K. Lautenbach. The analysis of distributed systems by means of predicate/transition-nets. In G. Kahn, editor, Semantics of Concurrent Computation, volume 70 of Lecture Notes in Computer Science, pages 123–146, Berlin, 1979. Springer-Verlag.

    Chapter  Google Scholar 

  34. H. J. Genrich and K. Lautenbach. System modelling with high-level Petri nets. Theoretical Computer Science, 13:109–136, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  35. J. Goguen and R. Burstall. Institutions: Abstract model theory for specification and programming. Journal of the ACM, 39(1):95–146, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  36. H. M. Hanisch. Analysis of place/transition nets with timed arcs and its application to batch process control. In M. A. Marsan, editor, Application and Theory of Petri Nets 1993, volume 691 of Lecture Notes in Computer Science, pages 282–299. Springer, 1993.

    Google Scholar 

  37. K. Hoffmann. Run time modification of algebraic high level nets and algebraic higher order nets using folding and unfolding construction. In G. Hommel, editor, Communication-Based Systems, Proceedings of the 3rd International Workshop held at the TU Berlin, Germany, 31 March–1 April 2000, pages 55–72. Kluwer Academic Publishers, 2000.

    Google Scholar 

  38. K. Jensen. Coloured Petri nets and the invariant-method. Theoretical Computer Science, pages 317–336, 1981.

    Google Scholar 

  39. K. Jensen. Coloured Petri Nets, Basic Concepts, Analysis Methods and Practical Use., volume 1 of EATCS monographs on theoretical computer science. Springer-Verlag, 1992.

    Google Scholar 

  40. E. Kettunen, E. Montonen, and T. Tuuliniemi. Comparison of Pr-net based channel models. In Proc. of the 12th IMACS World Conf., volume 3, pages 479–482, 1988.

    Google Scholar 

  41. E. Kindler and W. Reisig. Algebraic system nets for modelling distributed algorithms. Petri Net Newsletter, (51):16–31, December 1996.

    Google Scholar 

  42. E. Kindler, W. Reisig, H. Völzer, and R. Walter. Petri net based verification of distributed algorithms: An example. Formal Aspects of Computing, 9:409–424, 1997.

    Article  MATH  Google Scholar 

  43. E. Kindler and H. Völzer. Flexibility in algebraic nets. In J. Desel and M. Silva, editors, Application and Theory of Petri Nets 1998, 19th International Conference, ICATPN’98, Lisbon, Portugal, June 1998, Proceedings, volume 1420 of Lecture Notes in Computer Science, pages 345–384. Springer-Verlag, 1998.

    Google Scholar 

  44. C. A. Lakos. From coloured Petri nets to object Petri nets. In M. Diaz G. De Michelis, editor, Application and Theory of Petri Nets, volume 935 of Lecture Notes in Computer Science, pages 278–297, Berlin, 1995. Springer-Verlag.

    Google Scholar 

  45. N. Martí-Oliet and J. Meseguer. From Petri nets to linear logic. Mathematical Structures in Computer Science, 1:69–101, 1991.

    Article  MATH  Google Scholar 

  46. N. Martí-Oliet and J. Meseguer. From Petri nets to linear logic through categories: A survey. International Journal of Foundations of Computer Science, 2(4):297–399, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  47. J. Meseguer. General logics. In H.-D. Ebbinghaus et al., editors, Proceedings, Logic Colloquium, 1987, pages 275–329. North-Holland, 1989.

    Google Scholar 

  48. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73–155, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  49. J. Meseguer. A logical theory of concurrent objects and its realization in the Maude language. In G. Agha, P. Wegner, and A. Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming. MIT Press, 1993.

    Google Scholar 

  50. J. Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In U. Montanari and V. Sassone, editors, Proc. Concur’96, volume 1119 of Lecture Notes in Computer Science, pages 331–372. Springer, 1996.

    Google Scholar 

  51. J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi-Presicce, editor, Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT’ 97, Tarquinia, Italy, June 3–7, 1997, Selected Papers, volume 1376 of Lecture Notes in Computer Science, pages 18–61. Springer-Verlag, 1998.

    Google Scholar 

  52. J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88(2):105–155, October 1990.

    Google Scholar 

  53. J. Meseguer, U. Montanari, and V. Sassone. On the semantics of Petri nets. In W.R. Cleaveland, editor, Proceedings of the Concur’92 Conference, Stony Brook, New York, August 1992, volume 630 of Lecture Notes in Computer Science, pages 286–301. Springer-Verlag, 1992.

    Google Scholar 

  54. J. Meseguer, U. Montanari, and V. Sassone. On the model of computation of place/transition Petri nets. In Proceedings 15th International Conference on Application and Theory of Petri Nets, volume 815 of Lecture Notes in Computer Science, pages 16–38. Springer-Verlag, 1994.

    Google Scholar 

  55. J. Meseguer, U. Montanari, and V. Sassone. Process versus unfolding semantics for place/transition Petri nets. Theoretical Computer Science, 153(1–2):171–210, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  56. J. Meseguer, U. Montanari, and V. Sassone. Representation theorems for Petri nets. In C. Freska, M. Jantzen, and R. Valk, editors, Foundations of Computer Science: Potential, Theory, Cognition, volume 1337 of Lecture Notes in Computer Science, pages 239–249. Springer-Verlag, 1997.

    Google Scholar 

  57. J. Meseguer and C. Talcott. A partial order event model for concurrent objects. In Proc. CONCUR’99, Eindhoven, The Netherlands, August 1999, volume 1664 of Lecture Notes in Computer Science, pages 415–430. Springer-Verlag, 1999.

    Google Scholar 

  58. U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32:545–596, 1995.

    MATH  MathSciNet  Google Scholar 

  59. S. Morasca, M. Pezzè, and M. Trubian. Timed high-level nets. The Journal of Real-Time Systems, 3:165–189, 1991.

    Article  Google Scholar 

  60. P. C. Ölveczky. Specification and Analysis of Real-Time and Hybrid Systems in Rewriting Logic. PhD thesis, University of Bergen, 2000. Available at http://maude.csl.sri.com/papers.

  61. P. C. Olveczky and J. Meseguer. Real-Time Maude: A tool for simulating and analyzing real-time and hybrid systems. In Third International Workshop on Rewriting Logic and its Applications, 2000. To appear in Electronic Notes in Theoretical Computer Science.

    Google Scholar 

  62. P. C. Ölveczky and J. Meseguer. Specification of real-time and hybrid systems in rewriting logic. To appear in Theoretical Computer Science. Available at http://maude.csl.sri.com/papers, September 2000.

  63. C. A. Petri. Nets, time and space. Theoretical Computer Science, 153(1–2):3–48, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  64. W. Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80:1–34, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  65. W. Reisig. Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets. Springer-Verlag, 1998.

    Google Scholar 

  66. W. Reisig and J. Vautherin. An algebraic approach to high level Petri nets. In Proceedings of the Eighth European Workshop on Application and Theory of Petri Nets, pages 51–72. Universidad de Zaragoza (Spain), 1987.

    Google Scholar 

  67. C. Sibertin-Blanc. Cooperative nets. In R. Valette, editor, Application and Theory of Petri Nets, volume 815 of Lecture Notes in Computer Science, pages 471–490, Berlin, 1994. Springer-Verlag.

    Google Scholar 

  68. M.-O. Stehr. CINNI-A Generic Calculus of Explicit Substitutions and its Application to lambda-, sigma-and pi-calculi. In K. Futatsugi, editor, Third International Workshop on Rewriting Logic and its Applications (WRLA’ 2000), Kanazawa, Japan, September 18–20, 2000, volume 36 of Electronic Notes in Theoretical Computer Science, pages 71–92. Elsevier, 2000. http://www.elsevier.nl/locate/entcs/volume36.html.

  69. M.-O. Stehr. A rewriting semantics for algebraic nets. In C. Girault and R. Valk, editors, Petri Nets for Systems Engineering-A Guide to Modelling, Verification, and Applications. Springer-Verlag, 2001. To appear.

    Google Scholar 

  70. M.-O. Stehr and J. Meseguer. Pure type systems in rewriting logic. In Proc. of LFM’99: Workshop on Logical Frameworks and Meta-languages, Paris, France, September 28, 1999.

    Google Scholar 

  71. A. Tarlecki, R. M. Burstall, and J. A. Goguen. Some fundamental algebraic tools for the semantics of computation, III: indexed categories. Theoretical Computer Science, 79:239–264, 1991.

    Article  MathSciNet  Google Scholar 

  72. R. Valk. Petri nets as dynamical objects. In Workshop Proc. 16th International Conf. on Application and Theory of Petri Nets, Torino, Italy, June 1995.

    Google Scholar 

  73. R. Valk. Petri nets as token objects: An introduction to elementary object nets. In J. Desel and M. Silva, editors, Proceedings of the 19th International Conference on Application and Theory of Petri Nets, Lissabon, June 22–26, 1998, volume 1420 of Lecture Notes in Computer Science, pages 1–25. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  74. R. Valk. Relating Different Semantics for Object Petri Nets. Technical report, FBI-HH-B-266/00, Fachbereich Informatik, Universität Hamburg, 2000.

    Google Scholar 

  75. J. Vautherin. Un Modele Algebrique, Base sur les Reseaux de Petri, pour l’Etude des Systemes Paralleles. These de Docteur Ingenieur, Univ. de Paris-Sud, Centre d’Orsay, June 1985.

    Google Scholar 

  76. J. Vautherin. Parallel systems specifications with coloured Petri nets and algebraic specifications. Lecture Notes in Computer Science: Advances in Petri Nets 1987, 266:293–308, 1987.

    MathSciNet  Google Scholar 

  77. P. Viry. Rewriting: An effective model of concurrency. In C. Halatsis, D. Maritsas, G. Philokyprou, and S. Theodoridis, editors, PARLE’94-Parallel Architectures and Languages Europe, 6th Int. PARLE Conf. Athes, Greece, July 1994, Proceedings., volume 817 of Lecture Notes in Computer Science, pages 648–660. Springer-Verlag, 1994.

    Google Scholar 

  78. W. Vogler. Partial order semantics and test arcs. In Proc. MFCS’97, volume 1295 of Lecture Notes in Computer Science. Springer, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SRI International, Menlo Park, CA, 94025, USA

    Mark-Oliver Stehr, José Meseguer & Peter Csaba Ölveczky

Authors
  1. Mark-Oliver Stehr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Csaba Ölveczky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Franklinstr. 28/29, 10587, Berlin, Germany

    Hartmut Ehrig  & Julia Padberg  & 

  2. Katholische Universität Eichstätt, Ostenstr. 28, 85072, Eichstätt, Germany

    Gabriel Juhás

  3. Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Stehr, MO., Meseguer, J., Ölveczky, P.C. (2001). Rewriting Logic as a Unifying Framework for Petri Nets. In: Ehrig, H., Padberg, J., Juhás, G., Rozenberg, G. (eds) Unifying Petri Nets. Lecture Notes in Computer Science, vol 2128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45541-8_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45541-8_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43067-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation