Skip to main content
Springer Nature Link
Log in

Time Petri Nets with Inhibitor Hyperarcs. Formal Semantics and State Space Computation

  • Conference paper
Applications and Theory of Petri Nets 2004 (ICATPN 2004)

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

Included in the following conference series:

  • 740 Accesses

Abstract

In this paper, we define Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of T-time Petri nets where time is associated with transitions. In this model, we consider stopwatches associated with transitions which can be reset, stopped and started by using classical arcs and branch inhibitor hyperarcs introduced by Janicki and Koutny [x]. We give a formal semantics for IHTPNs in terms of Timed Transition Systems and we position IHTPNs with regard to other classes of Petri nets in terms of timed language acceptance. We provide a method for computing the state space of IHTPNs. We first propose an exact computation using a general polyhedron representation of time constraints, then we propose an overapproximation of the polyhedra to allow a more efficient compact abstract representations of the state space based on DBM (Difference Bound Matrix).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Abdulla, P.A., Nylén, A.: Timed Petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 53–72. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Agerwala, T.: A complete model for representing the coordination of asynchronous processes. Technical report, John Hopkins University, Baltimore, Maryland (1974)

    Google Scholar 

  3. Berthomieu, B.: La méthode des classes d’états pour l’analyse des réseaux temporels. In: 3e congrès Modélisation des Systèmes Réactifs (MSR 2001), Toulouse, France, October 2001, pp. 275–290. Hermes (2001)

    Google Scholar 

  4. Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time Petri nets. IEEE transactions on software engineering 17(3), 259–273 (1991)

    Article  MathSciNet  Google Scholar 

  5. Berthomieu, B., Vernadat, F.: State class constructions for branching analysis of time Petri nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 442–457. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Bucci, G., Fedeli, A., Sassoli, L., Vicario, E.: Modeling flexible real time systems with preemptive time Petri nets. In: 15th Euromicro Conference on Real-Time Systems (ECRTS 2003), pp. 279–286 (2003)

    Google Scholar 

  7. Cassez, F., Larsen, K.G.: The impressive power of stopwatches. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, p. 138. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Chiola, G., Donatelli, S., Franceshinis, G.: Priorities, inhibitor arcs and concurrency in PT nets. In: 12th international conference on Application and Theory of Petri Nets, pp. 182–205 (1991)

    Google Scholar 

  9. Dantzig, G.B.: Linear programming and extensions. IEICE Transactions on Information and Systems (1963)

    Google Scholar 

  10. de Frutos Escrig, D., Valero Ruiz, V., Marroquín Alonso, O.: Decidability of properties of timed-arc petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 187–206. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Diaz, M., Senac, P.: Time stream Petri nets: a model for timed multimedia information. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol. 815, pp. 219–238. Springer, Heidelberg (1994)

    Google Scholar 

  12. Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197–212. Springer, Heidelberg (1989)

    Google Scholar 

  13. Gardey, G., Roux, O.H., Roux, O.F.: A zone-based method for computing the state space of a time Petri net. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791. Springer, Heidelberg (2003)

    Google Scholar 

  14. Hack, M.: Petri net language. In: Computation Structures Group Memo 127. MIT, Cambridge (1975)

    Google Scholar 

  15. Janicki, R., Koutny, M.: Invariant semantics of nets with inhibitor arcs. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 317–331. Springer, Heidelberg (1991)

    Google Scholar 

  16. Janicki, R., Koutny, M.: Semantics of inhibitor nets. Information and Computation 123(1), 1–15 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Janicki, R., Koutny, M.: On causality semantics of nets with priorities. Fundamenta Informaticae 38(3), 223–255 (1999)

    MATH  MathSciNet  Google Scholar 

  18. Khansa, W., Denat, J.-P., Collart-Dutilleul, S.: P-Time Petri Nets for manufacturing systems. In: International Workshop on Discrete Event Systems, WODES 1996, Edinburgh, U.K., August 1996, pp. 94–102 (1996)

    Google Scholar 

  19. Larsen, K.G., Pettersson, P., Yi, W.: Model-checking for real-time systems. In: Fundamentals of Computation Theory, pp. 62–88 (1995)

    Google Scholar 

  20. Lilius, J.: Efficient state space search for time Petri nets. In: MFCS Workshop on Concurrency 1998. ENTCS, vol. 18. Elsevier, Amsterdam (1999)

    Google Scholar 

  21. Lime, D., Roux, O.H.: Expressiveness and analysis of scheduling extended time Petri nets. In: 5th IFAC International Conference on Fieldbus Systems and their Applications (FET 2003), July 2003. Elsevier Science, Amsterdam (2003)

    Google Scholar 

  22. Lime, D., Roux, O.H.: State class timed automaton of a time Petri net. In: 10th International Workshop on Petri Nets and Performance Models (PNPM 2003), September 2003. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  23. Menasche, M.: Analyse des réseaux de Petri temporisés et application aux systèmes distribués. PhD thesis, Université Paul Sabatier, Toulouse, France (1982)

    Google Scholar 

  24. Merlin, P.M.: A study of the recoverability of computing systems. PhD thesis, Department of Information and Computer Science, University of California, Irvine, CA (1974)

    Google Scholar 

  25. Okawa, Y., Yoneda, T.: Schedulability verification of real-time systems with extended time Petri nets. International Journal of Mini and Microcomputers 18(3), 148–156 (1996)

    Google Scholar 

  26. Peterson, J.L.: Petri net theory and the modeling of systems. Prentice-Hall, New-York (1981)

    Google Scholar 

  27. Pezze, M., Toung, M.: Time Petri nets: A primer introduction. In: Tutorial presented at the Multi-Workshop on Formal Methods in Performance Evaluation and Applications, Zaragoza, Spain (September 1999)

    Google Scholar 

  28. Popova, L.: On time Petri nets. Journal on Information Processing and Cybernetics, EIK 27(4), 227–244 (1991)

    MATH  Google Scholar 

  29. Ramchandani, C.: Analysis of asynchronous concurrent systems by timed Petri nets. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, Project MAC Report MAC-TR-120 (1974)

    Google Scholar 

  30. Roux, O.H., Déplanche, A.-M.: A t-time Petri net extension for real time-task scheduling modeling. European Journal of Automation (JESA) 36(7) (2002)

    Google Scholar 

  31. Toussaint, J., Simonot-Lion, F., Thomesse, J.-P.: Time constraint verification methods based on time Petri nets. In: 6th Workshop on Future Trends in Distributed Computing Systems (FTDCS 1997), Tunis, Tunisia, pp. 262–267 (1997)

    Google Scholar 

  32. Yoneda, T., Ryuba, H.: CTL model checking of time Petri nets using geometric regions. IEICE Transactions on Information and Systems E99-D(3), 297–396 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRCCyN (Institut de Recherche en Communication et Cybernétique de Nantes), 1, rue de la Noë, B.P. 92101, 44321, NANTES cedex 3, France

    Olivier H. Roux & Didier Lime

Authors
  1. Olivier H. Roux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Didier Lime
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Spain

    Jordi Cortadella

  2. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Wolfgang Reisig

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roux, O.H., Lime, D. (2004). Time Petri Nets with Inhibitor Hyperarcs. Formal Semantics and State Space Computation. In: Cortadella, J., Reisig, W. (eds) Applications and Theory of Petri Nets 2004. ICATPN 2004. Lecture Notes in Computer Science, vol 3099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27793-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27793-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22236-1

  • Online ISBN: 978-3-540-27793-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics