Skip to main content
SpringerLink
Log in

Abstract Petri Nets as a Uniform Approach to High-Level Petri Nets

  • Conference paper
  • First Online:
Book cover Recent Trends in Algebraic Development Techniques

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

Abstract

In the area of Petri nets, many different developments have taken place within the last 30 years, in academia as well as in practice. For an adequate use in practice, a coherent and application oriented combination of various types and techniques for Petri nets is necessary. In order to attain a formal basis for different classes of Petri nets we introduce the concept of abstract Petri nets. The essential point of abstract Petri nets is to allow different kinds of net structures as well as the combination of various kinds of data types. This means that in abstract Petri nets the data type and the net structure part can be considered as abstract parameters which can be instantiated to different concrete net classes. We show that several net classes, like place/transition nets, elementary nets, S-graphs, algebraic high-level nets, and predicate/transitions nets are instantiations of abstract Petri nets. Moreover, we discuss coloured Petri nets in this context.

★★

This work is part of the joint research project “DFG-Forschergruppe Petrinetz-Technologie” between H. Weber (Coordinator), H. Ehrig (both from the Technical University Berlin) and W. Reisig (Humboldt-Universität zu Berlin), supported by the German Research Council (DFG).

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. P. Azéma and G. Balbo (eds.), Application and Theory of Petri Nets, Springer-Verlag, LNCS 1248, 1997.

    Google Scholar 

  2. J. Adamek, H. Herrlich, and G. Strecker, Abstract and concrete categories, Series in Pure and Applied Mathematics, John Wiley and Sons, 1990.

    Google Scholar 

  3. J. Billington and W. Reisig (eds.), Proc. 17th international conference in application and theory of petri nets (ICATPN’96), Osaka, Japan., Springer-Verlag Lecture Notes in Computer Science, 1996.

    Google Scholar 

  4. W. Deiters and V. Gruhn, The funsoft net approach to software process management, International Journal on Software Engineering and Knowledge Engineering 4 (1994), no. 2

    Google Scholar 

  5. Wolfgang Deiters and Volker Gruhn, Process management in practice-applying the funsoft net approach to large-scale processes, Automated Software Engineering 5 (1998), 7–25.

    Article  Google Scholar 

  6. H. Ehrig, M. Baldamus, and F. Orejas, New concepts for amalgamation and extension in the framework of specification logics, Tech. Report 91/05, 1991.

    Google Scholar 

  7. H. Ehrig and M. Groβe-Rhode, Functorial Theory of Parameterized Specifications in a General Specification Framework, Theoretical Computer Science (1994), no. 135, 221–266.

    Google Scholar 

  8. H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce, From graph grammars to High Level Replacement Systems, (H. Ehrig, H.-J. Kreowski, and G. Rozenberg, eds.), 1991, Lecture Notes in Computer Science 532, pp. 269–291.

    MATH  Google Scholar 

  9. H. Ehrig, K.D. Kiermeier, H.J. Kreowski, and W. Küuhnel, Universal Theory of Automata, Teubner, Stuttgart, 1974.

    Google Scholar 

  10. H. Ehrig and M. Löwe, Categorical principles, techniques and results for high-level replacement systems in computer science, Applied Categorical Structures 1 (1993), no. 1, 21–50.

    Article  MathSciNet  Google Scholar 

  11. H. Ehrig and B. Mahr, Fundamentals of algebraic specification 1: Equations and initial semantics, EATCS Monographs on Theoretical Computer Science, vol. 6, Springer, Berlin, 1985.

    Google Scholar 

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

    Chapter  Google Scholar 

  13. H. Ehrig, J. Padberg, and L. Ribeiro, Algebraic high-level nets: Petri nets revisited, Recent Trends in Data Type Specification, Springer, LNCS 785, 1994, pp. 188–206.

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  16. J. A. Goguen and R. M. Burstall, Institutions: Abstract Model Theory for Specification and Programming, Journals of the ACM 39 (1992), no. 1, 95–146.

    Google Scholar 

  17. H.J. Genrich, Predicate/Transition Nets, High-Level Petri Nets: Theory and Application, Springer, 1991, pp. 3–43.

    Google Scholar 

  18. H.J. Genrich and K. Lautenbach, System modelling with high-level Petrinets, 109–136.

    Google Scholar 

  19. U. Hummert, Algebraische High-Level Netze, Ph.D. thesis, Technische Universität Berlin, 1989.

    Google Scholar 

  20. K. Jensen, Coloured petri nets and the invariant method, Theorecical Computer Science 14 (1981), 317–336.

    Article  MathSciNet  Google Scholar 

  21. K. Jensen, Coloured Petri nets. basic concepts, analysis methods and practical use, vol. 1, Springer, 1992.

    Google Scholar 

  22. K. Jensen, Coloured petri nets: Analysis methods, Monographs in Theoretical Computer Science (Salomaa Brauer Rozenberg, ed.), EATCS, Springer Verlag, 1994.

    Google Scholar 

  23. K. Jensen, Coloured Petri nets. basic concepts, analysis methods and practical use, vol. 2, Springer, 1995.

    Google Scholar 

  24. Rüdiger Jegelka, Wolfgang Ferber, and Niko Vlachantonis, Anwendungsen-twicklung in der LION Entwicklungsumgebung (LEU), Unpublished guideline for quality QRL-ANW-001, LION, 1995.

    Google Scholar 

  25. K. Jensen and G. Rozenberg (eds.), High-Level Petri-Nets: Theory and Application, Springer-Verlag, 1991.

    Google Scholar 

  26. Ekkart Kindler and Hagen Völzer, Flexibility in algebraic nets, Application and Theory of Petri Nets 1998, 19th International Conference (J. Desel and M. Silva, eds.), Springer-Verlag, June 1998, pp. 345–364.

    Google Scholar 

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

    Google Scholar 

  28. J. Lilius, On the structure of high-level nets, Ph.D. thesis, Helsinki University of Technology, 1994.

    Google Scholar 

  29. B. Mahr, Empty carriers: the categorical burden on logic, Categorical Methods in Computer Science-with Aspects from Topology (H. Ehrig, H. Herrlich, H.J. Kreowski, and G. Preuβ, eds.), Springer LNCS 393, 1989, pp. 50–65.

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  31. J. Padberg, Abstract Petri Nets: A Uniform Approach and Rule-Based Renement, Ph.D. thesis, Technical University Berlin, 1996.

    Google Scholar 

  32. Julia Padberg, Categorical Approach to Horizontal Structuring and Renement of High-Level Replacement Systems, Applied Categorical Structures (1998), accepted.

    Google Scholar 

  33. Julia Padberg, Classification of Petri Nets Using Adjoint Functors, Bulletin of EACTS (1998), to appear.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  35. J. Padberg, M. Gajewsky, and C. Ermel, Rule-Based Renement of High-Level Nets Preserving Safety Properties, Fundamental approaches to Software Engineering (E. Astesiano, ed.), Springer, LNCS 1382, 1998, pp. 221–238.

    Chapter  Google Scholar 

  36. W. Reisig, Petri Nets and Abstract Data Types, Thooretical Computer Science (Fundamental Studies) (1991), no. 80, 1–34.

    Google Scholar 

  37. Grzegorz Rozenberg (ed.), Advances in petri nets 1992., vol. 609, Springer-Verlag Lecture Notes in Computer Science, Berlin, Germany, 1992.

    Google Scholar 

  38. Grzegorz Rozenberg (ed.), Advances in petri nets 1993., vol. 674, Springer-Verlag Lecture Notes in Computer Science, Berlin, Germany, 1993.

    MATH  Google Scholar 

  39. D. Sanella, Personal communiction, 1995.

    Google Scholar 

  40. K. Schimmel, Abstimmung der Implementierungssoftware INCOME/STAR, Arbeitsbericht des Instituts für Produktionswirtschaft und Industrielle Informationswirtschaft der Universität Leipzig, 1996.

    Google Scholar 

  41. S. Salibra and G. Scollo, A soft stairway to institutions, Recent Trends in Data Type Specification, Springer, 1992, LNCS 655, pp. 310–329.

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  43. D. T. Sannella and A. Tarlecki, Extended ML: an institution-independent framework for formal program development, Proc. Workshop on Category Theory and Computer Programming, LNCS 240, Springer, 1986, pp. 364–389.

    Chapter  Google Scholar 

  44. D.T. Sannella and A. Tarlecki, On observational equivalence and algebraic specification, JCSS 34 (1987), 150–187.

    MathSciNet  MATH  Google Scholar 

  45. D. T. Sannella and A. Tarlecki, Extended ML: Past, present and future, Tech. Report ECS-LFCS-91-138, University of Edinburgh, labroratory for Foundation of Computer Science, 1991.

    Google Scholar 

  46. A. Tarlecki, Bits and pieces of the theory of institutions, Proc. of Summer Workshop on Category Theory and Computer Programming, Springer, LNCS 240, 1987, pp. 334–363.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technical University of Berlin, Germany

    J. Padberg

Authors
  1. J. Padberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Lisbon, Campo Grande 1700, Lisbon, Portugal

    José Luiz Fiadeiro

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Padberg, J. (1999). Abstract Petri Nets as a Uniform Approach to High-Level Petri Nets. In: Fiadeiro, J.L. (eds) Recent Trends in Algebraic Development Techniques. Lecture Notes in Computer Science, vol 1589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48483-3_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-48483-3_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation