Skip to main content
SpringerLink
Log in

Hierarchical Timed High Level Nets and Their Branching Processes

  • Conference paper
  • First Online:
Applications and Theory of Petri Nets 2003 (ICATPN 2003)

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

Included in the following conference series:

Abstract

The paper aims at defining hierarchical time extensions of M-nets, a fully compositional class of high-level Petri nets. As a starting point, the class of classical timed M-nets are considered, where time intervals of duration are attached to each transition. This class is enriched by two new operations: timed refinement (which extends the class) and hierarchical scoping (which is shown to be a powerful feature for abstraction). It is argued that hierarchical timed M-nets permit the design of real-time systems in a top down manner. Moreover, a partial order semantics of hierarchical timed M-nets is defined based on branching processes. The definition is given directly for high level nets, without preliminary unfolding to low level nets. This semantics enables partial order model checking of hierarchical timed M-nets e.g. within the PEP-system.

This work has been partially supported by the Procope project PORTA (Partial Order Real Time Semantics).

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. O. M. Alonso and D. de Frutos Escrig. Extending the Petri Box Calculus with Time. In J. Colom, M. Koutny, (Eds.), Advances in Petri Nets 2001, Volume 2075 of LNCS, pages 303–322. Springer, (2001).

    Chapter  Google Scholar 

  2. T. Aura, J. Lilius: Time Processes for Time Petri Nets. Proc. ICATPN, Toulouse (1997).

    Google Scholar 

  3. B. Berthomieu, M. Diaz: Modelling and Verification of Time Dependent Systems Using Time Petri Nets. IEEE Transactions on Software Engineering, Volume 17/3, 259–273 (1991).

    Article  MathSciNet  Google Scholar 

  4. E. Best: Partial Order Verification with PEP. Proc. POMIV’96, Partial Order Methods in Verification, G. Holzmann, D. Peled, and V. Pratt (eds.), American Mathematical Society (1996).

    Google Scholar 

  5. E. Best, R. Devillers, and J. Esparza. General refinement and recursion operators for the Petri box calculus. LNCS 665:130–140, (1993).

    Google Scholar 

  6. E. Best, R. Devillers, and J. G. Hall. The box calculus: a New Causal Algebra With Multi-Label Communication. In G. Rozenberg, (Ed.), Advances in Petri Nets 92, Volume 609 of LNCS, pages 21–69. Springer, 1992.

    Google Scholar 

  7. E. Best, R. Devillers, and M. Koutny. Petri Net Algebra. Springer-Verlag. EATCS Monographs on Theoretical Computer Science Series 2001.

    Google Scholar 

  8. E. Best, H. Fleischhack, W. Fraczak, R. P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. In G. De Michelis and M. Diaz, (Eds.), Application and Theory of Petri Nets 1995, Volume 935 of LNCS, pages 103–118. Springer, 1995.

    Google Scholar 

  9. E. Best, W. Fraczak, R. Hopkins, H. Klaudel, and E. Pelz. M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages. Acta Informatica, 35, 1998.

    Google Scholar 

  10. B. Bieber and H. Fleischhack: Model Checking of Time Petri Nets Based on Partial Order Semantics. Proceedings of ConCur’99, Eindhoven (1999).

    Google Scholar 

  11. R. Devillers and H. Klaudel. Refinement and Recursion in a High Level Petri Box Calculus. STRICT’95. Springer, ViC, 144–159 (1995).

    Google Scholar 

  12. R. Devillers, H. Klaudel and R.-C. Riemann. General Refinement for High Level Petri Nets. FST & TCS’97, Springer, LNCS Vol. 1346, 297–311 (1997).

    Google Scholar 

  13. R. Devillers, H. Klaudel and R.-C. Riemann. General parameterised refinement for the M-net calculus. Theoretical Computer Science, to appear.

    Google Scholar 

  14. R. Durchholz. Causality, time, and deadlines. Data & Knowledge Engineering, 6:496–477, 1991.

    Article  Google Scholar 

  15. J. Engelfriet: Branching Processes of Petri Nets, Acta Informatica, Volume 28, pages 575–591 (1991).

    Article  MATH  MathSciNet  Google Scholar 

  16. J. Esparza: Model Checking Using Net Unfoldings. Science of Computer Programming, Volume 23, 151–195, Elsevier (1994).

    Article  MATH  MathSciNet  Google Scholar 

  17. J. Esparza, S. Römer, and W. Vogler: An Improvement of McMillan’s Unfolding Algorithm. Proc. of TACAS’96 (1996).

    Google Scholar 

  18. H. Fleischhack and C. Stehno. Computing a Finite Prefix of a Time Petri Net. In Advances in Petri Nets 2002, Volume 2360 of LNCS, pages 163–181. Springer, 2002.

    Chapter  Google Scholar 

  19. H. Klaudel and F. Pommereau. Asynchronous links in the PBC and M-nets. In Proc. of ASIAN’99, LNCS 1742:190–200, 1999.

    Google Scholar 

  20. H. Klaudel and F. Pommereau. A concurrent and compositional Petri net semantics of preemption. In W. Grieskamp, T. Santen, B. Stoddart (Eds.), Proc. of IFM’00, LNCS 1945, pages 318–337, Springer, 2000.

    Google Scholar 

  21. H. Klaudel and F. Pommereau. A Concurrent Semantics of Static Exceptions in a Parallel Programming Language. In J. Colom, M. Koutny, (Eds.), Advances in Petri Nets 2001, Volume 2075 of LNCS, pages 204–223. Springer, (2001).

    Chapter  Google Scholar 

  22. M. Koutny. A Compositional Model of Time Petri Nets. In M. Nielsen, D. Simpson, (Eds.), Advances in Petri Nets 2001, Volume 1825 of LNCS, pages 303–322. Springer, 2000.

    Chapter  Google Scholar 

  23. J. Lilius: Efficient state space search for time Petri nets. MFCS Workshop on Concurrency (1998).

    Google Scholar 

  24. K.L. McMillan: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. Proc. CAV’ 92, Fourth Workshop on Computer-Aided Verification, Vol. 663 of LNCS, 164–174 (1992).

    Google Scholar 

  25. P. Merlin, D. Farber: Recoverability of Communication Protocols — Implication of a Theoretical Study. IEEE Transactions on Software Communications, Vol. 24, 1036–1043 (1976).

    Article  MATH  MathSciNet  Google Scholar 

  26. E. Pelz and H. Fleischhack. High Level Petri Nets with Timing Constraints — a Comparison to appear in Proc. of ASCD 03, special volume of June 2003.

    Google Scholar 

  27. L. Popova: On Time Petri Nets. Journal of Information Processing and Cybernetics, Volume 1055 of LNCS, Springer (1991).

    Google Scholar 

  28. C. Ramchandani: Analysis of Asynchronous Concurrent Systems by Timed Petri Nets, MIT, Project MAC, Technical Report 120, (1974).

    Google Scholar 

  29. G. Richter. Counting interfaces for discrete time modeling. Technical Report rep-set-1998-26, GMD, 1998.

    Google Scholar 

  30. J. Sifakis: Performance Evaluation of Systems Using Nets. Volume 84 of LNCS, pages 307–319, Springer (1980).

    Google Scholar 

  31. P. Starke: Analyse von Petri-Netz-Modellen. Teubner Verlag, Stuttgart (1990) (in German).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik Carl-von-Ossietzky, Universität Oldenburg, D-26111, Oldenburg

    Hans Fleischhack

  2. LACL, Faculté de Sciences, Université Paris XII—Val de Marne, 61 avenue du Général de Gaulle, F-94010, Créteil Cedex

    Elisabeth Pelz

Authors
  1. Hans Fleischhack
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elisabeth Pelz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Technology and Management, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Wil M. P. van der Aalst

  2. Computer Science Department Parallel Systems Group, University of Oldenburg, 26111, Oldenburg, Germany

    Eike Best

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fleischhack, H., Pelz, E. (2003). Hierarchical Timed High Level Nets and Their Branching Processes. In: van der Aalst, W.M.P., Best, E. (eds) Applications and Theory of Petri Nets 2003. ICATPN 2003. Lecture Notes in Computer Science, vol 2679. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44919-1_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-44919-1_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40334-0

  • Online ISBN: 978-3-540-44919-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation