Skip to main content

Parameterized Net Classes: A Uniform Approach to Petri Net Classes

  • Chapter
  • First Online:
Unifying Petri Nets

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

Abstract

The concept of parameterized net classes is introduced in order to allow a uniform approach to different kinds of Petri net classes. By different actualizations of the net structure parameter and the data type formalism parameter we obtain several well-known net classes, like elementary nets, place-transition nets, colored nets, predicate transition nets, and algebraic high-level nets, as well as several interesting new classes of low- and high-level nets. First the concept of parameterized net classes is defined on a purely set theoretical level, subsequently we give the concepts taking into account also morphisms and universal properties in the sense of category theory. We explain the underlying notions in an intuitive way. Moreover we give extracts from two of our case studies, where the application of these notions are illustrated in specific net classes, i.e. in instantiations of the parameterized net class.

The formal foundation of parameterized net classes this the uniform theory of abstract Petri nets. Low-level abstract Petri nets are a special case of high-level abstract Petri nets, but for better understanding they are presented separately. The theory of abstract Petri nets yields sufficient concepts and results for a specification technique of parameterized net classes. Operational behavior of nets is so presented in a uniform way. Different notions of horizontal structuring, rule-based refinement and their compatibility become available. The horizontal structuring techniques comprise union and fusion of nets. Last but not least we present some examples from our case studies using the notions and results introduced in this paper.

This work is part of the joint research project “DFG-Forschergruppe Petri Net Technology’ between H. Weber (Coordinator), H. Ehrig (both from the Technical University Berlin), and W. Reisig (Humboldt University Berlin), supported by the Deutsche Forschungsgemeinschaft (DFG).

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. J. Adamek, H. Herrlich, and G. Strecker. Abstract and Concrete Categories. Series in Pure and Applied Mathematics. John Wiley and Sons, 1990.

    Google Scholar 

  2. E. Badouel, M. Bednarczyk, and P. Darondeau. Generalized Automata and their Net Representations. In H. Ehrig, G. Juhàs, J. Padberg, and G. Rozenberg, editors, Advances in Petri Nets: Unifying Petri Nets, Advances in Petri Nets. Springer, 2001.

    Google Scholar 

  3. 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, pages 20–43. Springer Verlag Berlin, 1988.

    Google Scholar 

  4. E. Badouel and Ph. Darondeau. Dualities between nets and automata induced by schizofrenic objects. In 6th International Conference on Category Theory and Computer Science, pages 24–43. Springer, LNCS 953, 1995.

    Google Scholar 

  5. E. Badouel and Ph. Darondeau. Theory of regions. In W. Reisig and G. Rozenberg, editors, Lectures on Petri Nets: Basic Models, pages 529–586. Springer, LNCS 1491, 1998.

    Google Scholar 

  6. L. Bernardinello and F. De Cindio. A survey of basic net models and modular net classes. In Advances in Petri Nets’92, pages 304–351. Springer LNCS 609, 1992.

    Google Scholar 

  7. E. Best, R. Devillers, and J. Hall. The Box Calculus: a new causal algebra with multi-label communication. In Advances in Petri Nets, pages 21–69. Lecture Notes in Computer Science 609, 1992.

    Google Scholar 

  8. W. Brauer, R. Gold, and W. Vogler. A Survey of Behaviour and Equivalence Preserving Refinements of Petri Nets. Advances in Petri Nets, Lecture Notes in Computer Science 483:1–46, 1990.

    Google Scholar 

  9. F. Cornelius, M. Baldamus, H. Ehrig, and F. Orejas. Abstract and behaviour module specifications. Mathematical Structures in Computer Science, 9:21–62, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  10. F. Cornelius, H. Hußmann, and M. Löwe. The Korso Case Study for Software Engineering with Formal Methods: A Medical Information System. In M. Broy and S. Jähnichen, editors, KORSO: Methods, Languages, and Tools for the Construction of Correct Software, pages 417–445. Springer LNCS 1009, 1995. Also appeared as technical report 94-5, TU Berlin.

    Chapter  Google Scholar 

  11. R. David and H. Alla. Petri nets for modelling of dynamic systems-a survey. Automatica, 30(2):175–202, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  12. W. Deiters and V. Gruhn. Software Process Model Analysis Based on FUNSOFT Nets. Mathematical Modelling and Simulation, 8, May 1991.

    Google Scholar 

  13. W. Deiters and V. Gruhn. The FunSoft Net Approach to Software Process Management. International Journal on Software Engineering and Knowledge Engineering, 4(2):229–256, June 1994.

    Google Scholar 

  14. W. Deiters and V. Gruhn. Process Management in Practice-Applying the FunSoft Net Approach to Large-Scale Processes. Automated Software Engineering, 5:7–25, 1998.

    Article  Google Scholar 

  15. J. Desel, G. Juhás, and R. Lorenz. Petri Nets over Partial Algebras. In H. Ehrig, G. Juhás, J. Padberg, and G. Rozenberg, editors, Advances in Petri Nets: Unifying Petri Nets, LNCS. Springer, 2001.

    Google Scholar 

  16. M. Droste and Shrott R. M. Petri nets and automata with concurrency relation-an adjunction. In M. Droste and Y. Gurevich, editors, Semantics of Programming Languages and Model Theory, pages 69–97. Gordon and Breach Sc. Publ., 1993.

    Google Scholar 

  17. M. Droste and R.M. Shortt. Continuous Petri Nets and Transition Systems. In H. Ehrig, G. Juhás, J. Padberg, and G. Rozenberg, editors, Advances in Petri Nets: Unifying Petri Nets, LNCS. Springer, 2001.

    Google Scholar 

  18. H. Ehrig, M. Baldamus, F. Cornelius, and F. Orejas. Theory of algebraic module specification including behavioural semantics and constraints and aspects of generalized morphisms. In Proc. AMAST’ 91, Iowa City. University of Iowa, 1991.

    Google Scholar 

  19. H. Ehrig, M. Baldamus, and F. Orejas. New concepts for amalgamation and extension in the framework of specification logics. Technical Report 91-05, Technical University of Berlin, 1991.

    Google Scholar 

  20. H. Ehrig and M. Große-Rhode. Functorial theory of parameterized specifications in a general specification framework. Theoretical Computer Science, (135):221–266, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  21. H. Ehrig, M. Gajewsky, S. Lembke, J. Padberg, and V. Gruhn. Reverse Petri Net Technology Transfer: On the Boundary of Theory and Application. In Hartmut Ehrig, Wolfgang Reisig, and Herbert Weber, editors, Move-On-Workshop der DFG-Forschergruppe Petrinetz-Technologie. Forschergruppe Petrinetz-Technologie, 1997. Technical Report TR 97-21, Technische Universität Berlin.

    Google Scholar 

  22. H. Ehrig, M. Gajewsky, S. Lembke, and J. Padberg. Reverse Petri Net Technology Transfer: On the Boundary of Theory and Application. In Lindsay Groves and Steve Reeves, editors, Formal Methods Pacific’ 97, pages 297–298. Springer-Verlag Singapore Pte. Ltd, 1997.

    Google Scholar 

  23. H. Ehrig, M. Große-Rhode, and U. Wolter. On the role of category theory in the area of algebraic specifications. In LNCS, Proc. WADT11, Oslo. Springer Verlag, 1996.

    Google Scholar 

  24. H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce. From graph grammars to High Level Replacement Systems. In H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors, 4th Int. Workshop on Graph Grammars and their Application to Computer Science, LNCS 532, pages 269–291. Springer Verlag, 1991. Lecture Notes in Computer Science 532.

    Chapter  Google Scholar 

  25. H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce. Parallelism and concurrency in high-level replacement systems. Math. Struct. in Comp. Science, 1:361–404, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  26. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, Berlin, 1985.

    MATH  Google Scholar 

  27. H. Ehrig and J. Padberg. A Uniform Approach to Petri Nets. In Ch. Freksa, M. Jantzen, and R. Valk, editors, Foundations of Computer Science: Potential-Theory-Cognition. Springer, LNCS 1337, 1997.

    Google Scholar 

  28. C. Ermel, J. Padberg, and H. Ehrig. Requirements Engineering of a Medical Information System Using Rule-Based Refinement of Petri Nets. In D. Cooke, B.J. Krämer, P. C-Y. Sheu, J.P. Tsai, and R. Mittermeir, editors, Proc. Integrated Design and Process Technology, pages 186–193. Society for Design and Process Science, 1996. Vol. 1.

    Google Scholar 

  29. H. Ehrig, J. Padberg, and L. Ribeiro. Algebraic High-Level Nets: Petri Nets Revisited. In Recent Trends in Data Type Specification, pages 188–206. Springer Verlag, 1994. Lecture Notes in Computer Science 785.

    Google Scholar 

  30. H. Ehrig, J. Padberg, and G. Rozenberg. Behaviour and realization construction for Petri nets based on free monoid and power set graphs. In Workshop on Concurrency, Specification & Programming. Humboldt University, 1994. Extended version as Technical Report of University of Leiden.

    Google Scholar 

  31. H. Ehrig and W. Reisig. Integration of Algebraic Specifications and Petri Nets. Bulletin EATCS, Formal Specification Column, (61):52–58, 1996.

    Google Scholar 

  32. C. Ermel. Anforderungsanalyse eines medizinischen Informationssystems mit Algebraischen High-Level-Netzen. Technical Report 96-15, TU Berlin, 1996.

    Google Scholar 

  33. E. Fleck, H. Hansen, B. Mahr, and H. Oswald. Systementwicklung für die Integration und Kommunikation von Patientendaten und-dokumenten. Forschungsbericht 02-91, PMI am DHZB, 1991.

    Google Scholar 

  34. J.A. Goguen and R.M. Burstall. Introducing institutions. Proc. Logics of Programming Workshop, Carnegie-Mellon, Springer LNCS 164:221–256, 1984.

    Google Scholar 

  35. H.J. Genrich. Predicate/Transition Nets. In High-Level Petri Nets: Theory and Application, pages 3–43. Springer Verlag, 1991.

    Google Scholar 

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

  37. Volker Gruhn and Sabine Lembke. Integration of Petri Net Based Process Description with Different Data Modelling Techniques. In Third World Conference on Integrated Design and Process Technology, pages 105–112. Society for Process and Design, 1998.

    Google Scholar 

  38. Volker Gruhn and Sabine Lembke. Flexible Integration of Petri Net Based Process Description with User-Specific Data Descriptions. Journal of Integrated Design and Process Technology, 1999. To appear.

    Google Scholar 

  39. U. Goltz and W. Reisig. The Non-Sequential Behaviour of Petri Nets. In Information and Computation, pages 125–147. Academic Press, 1983.

    Google Scholar 

  40. U. Hummert. Algebraische High-Level Netze. PhD thesis, Technische Universität Berlin, 1989.

    Google Scholar 

  41. K. Jensen. Coloured Petri Nets and the Invariant Method. Theoretical Computer Science, 14:317–336, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  42. K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use, volume 1: Basic Concepts. Springer Verlag, EATCS Monographs in Theoretical Computer Science edition, 1992.

    Google Scholar 

  43. K. Jensen and G. Rozenberg, editors. High-Level Petri-Nets: Theory and Application. Springer Verlag, 1991.

    Google Scholar 

  44. Gabriel Juhás. Algebraically generalised Petri nets. PhD thesis, Institute of Control Theory and Robotics, Slovak Academy of Sciences, 1998.

    Google Scholar 

  45. Gabriel Juhás. The essence of Petri nets and transition systems through Abelian groups. Electronic Notes in Theoretical Computer Science, 18, 1998.

    Google Scholar 

  46. Gabriel Juhás. Reasoning about algebraic generalisation of Petri nets. In Proc. of 20th Conference on Theory and Application of Petri nets, pages 324–343. Springer, LNCS 1639, 1999.

    Google Scholar 

  47. H. Klaudel and E. Pelz. Communication as unification in the Petri Box Calculus. Technical report, LRI, Universite de Paris Sud, 1995.

    Google Scholar 

  48. Ekkart Kindler and Michael Weber. The dimensions of Petri nets: The Petri net cube. Informatik-Bericht, Humboldt-Universität zu Berlin, 1998. To appear.

    Google Scholar 

  49. J. Lilius. On the Structure of High-Level Nets. PhD thesis, Helsinki University of Technology, 1995. Digital Systems Laoratory, Research Report 33.

    Google Scholar 

  50. B. Mahr. Empty carriers: the categorical burden on logic. In H. Ehrig, H. Herrlich, H.J. Kreowski, and G. Preuß, editors, Categorical Methods in Computer Science-with Aspects from Topology, pages 50–65. Springer LNCS 393, 1989.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  53. Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer Verlag, 1992.

    Google Scholar 

  54. J. Padberg. Survey of high-level replacement systems. Technical Report 93/8, Technical University of Berlin, 1993.

    Google Scholar 

  55. J. Padberg. Abstract Petri Nets: A Uniform Approach and Rule-Based Refinement. PhD thesis, Technical University Berlin, 1996. Shaker Verlag.

    Google Scholar 

  56. Julia Padberg. Classification of Petri Nets Using Adjoint Functors. Bulletin of EACTS 66, 1998.

    Google Scholar 

  57. J. Padberg. The Petri Net Baukasten: An Application-Oriented Petri Net Technology. In H. Ehrig, and W. Reisig, editors. Int. Colloquium on Petri Net Technologies for Modelling Communication Based Systems, Part II: The ≫Petri Net Baukastens≪. Fraunhofer Gesellschaft ISST, October 1999 Weber et al. [WER99], pages 191–209.

    Google Scholar 

  58. Julia Padberg. Categorical Approach to Horizontal Structuring and Refinement of High-Level Replacement Systems. Applied Categorical Structures, 7(4):371–403, December 1999.

    Google Scholar 

  59. J. Padberg, H. Ehrig, and L. Ribeiro. Algebraic high-level net transformation systems. Mathematical Structures in Computer Science, 5:217–256, 1995.

    MATH  MathSciNet  Google Scholar 

  60. J. Padberg, H. Ehrig, and G. Rozenberg. Behaviour and Realization Construction for Petri Nets Based on Free Monoid and Power Set Graphs. In H. Ehrig, G. Juhás, J. Padberg, and G. Rozenberg, editors, Advances in Petri Nets: Unifying Petri Nets, LNCS. Springer, 2001.

    Google Scholar 

  61. Julia Padberg, Maike Gajewsky, and Kathrin Hoffmann. Incremental Development of Safety Properties in Petri Net Transformations. In G. Engels and G. Rozenberg, editors, Theory and Application of Graph Transformations (TAGT’98), Lecture Notes in Computer Science 1764, pages 410–425. Springer Verlag, 1999.

    Google Scholar 

  62. H. Plünnecke and W. Reisig. Bibliography of Petri Nets 1990. Springer LNCS 524, 1991.

    Book  Google Scholar 

  63. W. Reisig. Petri Nets, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.

    Google Scholar 

  64. W. Reisig. Petri Nets and Algebraic Specifications. Theoretical Computer Science (Fundamental Studies), (80):1–34, April 1991.

    Google Scholar 

  65. Reisig, W. and Rozenberg, G., editors. Lectures on Petri Nets I: Applications, volume 1492 of Lecture Notes in Computer Science. Springer-Verlag, 1998.

    Google Scholar 

  66. Reisig, W. and Rozenberg, G., editors. Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science. Springer-Verlag, 1998.

    MATH  Google Scholar 

  67. G. Rozenberg and P.S. Thiagarajan. Petri nets: Basic notions, structure, behaviour. In Current Trends in Concurrency, pages 585–668. Lecture Notes in Computer Science 224, Springer, 1986.

    Chapter  Google Scholar 

  68. V. Sassone. An axiomatization of the category of Petri net computations. Mathematical Structures in Computer Science, 8:117–151, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  69. D. T. Sannella and A. Tarlecki. Building specifications in an arbitrary institution. In Proc. Int. Symposium on Semantics of Data Types, LNCS 173, pages 337–356. Springer, 1984.

    Google Scholar 

  70. A. Tarlecki, R.M. Burstall, and J.A. Goguen. Some fundamental algebraic tools for the semantics of computation. Part III: Indexed categories. Technical report, University of Edinburgh, 1987.

    Google Scholar 

  71. J. Vautherin. Parallel Specification with Coloured Petri Nets and Algebraic Data Types. In Proc. of the 7th European Workshop on Application and Theory of Petri nets, pages 5–23, Oxford, England, jul. 1986.

    Google Scholar 

  72. H. Weber, H. Ehrig, and W. Reisig, editors. Int. Colloquium on Petri Net Technologies for Modelling Communication Based Systems, Part II: The ≫Petri Net Baukastens≪. Fraunhofer Gesellschaft ISST, October 1999.

    Google Scholar 

  73. G. Winskel. Petri nets, algebras, morphisms, and compositionality. Information and Computation, 72:197–238, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  74. U. Wolter. Institutional frames. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specification, pages 469–482. 10th Workshop on Specification of Abstract Data Types joint with the 5th COMPASS Workshop, S. Margherita Italy, May/June 1994, Selected papers, Springer, LNCS 906, 1995.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Padberg, J., Ehrig, H. (2001). Parameterized Net Classes: A Uniform Approach to Petri Net Classes. 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_7

Download citation

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

  • 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