Time petri nets with inhibitor hyperarcs. Formal semantics and state space computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3099, Issue , 2004, Pages 371-390

  Roux, Olivier H ^a   Lime, Didier ^a  

^a INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

Inhibitor hyperarc; Real time systems; Semantics; State space; Time petri nets

Indexed keywords

COMPUTATION THEORY; FORMAL METHODS; GEOMETRY; INTERACTIVE COMPUTER SYSTEMS; PETRI NETS; SEMANTICS; STATE SPACE METHODS;

ABSTRACT REPRESENTATION; DIFFERENCE BOUND MATRICES; EXACT COMPUTATIONS; INHIBITOR HYPERARC; T-TIME PETRI NET; TIME CONSTRAINTS; TIME PETRI NETS; TIMED TRANSITION SYSTEMS;

REAL TIME SYSTEMS;

EID: 35048882595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27793-4_21     Document Type: Article

References (32)

1. P. A. Abdulla and A. Nylén. Timed Petri nets and BQOs. In 22nd International Conference on Application and Theory of Petri Nets (ICATPN'01), volume 2075 of Lecture Notes in Computer Science, pages 53-72, Newcastle upon Tyne, United Kingdom, June 2001. Springer-Verlag.
2. T. Agerwala. A complete model for representing the coordination of asynchronous processes. Technical report, John Hopkins University, Baltimore, Maryland., 1974.
3. B. Berthomieu. 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), pages 275-290, Toulouse, France, October 2001. Hermes.
4. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE transactions on software engineering, 17(3):259-273, 1991.
5. B. Berthomieu and F. Vernadat. State class constructions for branching analysis of time Petri nets. In 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2003), pages 442-457. Springer-Verlag, Apr 2003.
6. G. Bucci, A. Fedeli, L. Sassoli, and E. Vicario. Modeling flexible real time systems with preemptive time Petri nets. In 15th Euromicro Conference on Real-Time Systems (ECRTS'2003), pages 279-286, 2003.
7. Franck Cassez and Kim Guldstrand Larsen. The impressive power of stopwatches. In Catuscia Palamidesi, editor, 11th International Conference on Concurrency Theory, (CONCUR'2000), number 1877 in Lecture Notes in Computer Science, pages 138-152, University Park, P.A., USA, July 2000. Springer-Verlag.
8. G. Chiola, S. Donatelli, and G. Franceshinis. Priorities, inhibitor arcs and concurrency in PT nets. In 12th international conference on Application and Theory of Petri Nets, pages 182-205, 1991.
9. G. B. Dantzig. Linear programming and extensions. IEICE Transactions on Information and Systems, 1963.
10. D. de Frutos Escrig, V. Valero Ruiz, and O. Marroquín Alonso. Decidability of properties of timed-arc Petri nets. In 21st International Conference on Application and Theory of Petri Nets (ICATPN'00), volume 1825 of Lecture Notes in Computer Science, pages 187-206, Aarhus, Denmark, June 2000. Springer-Verlag.
11. M. Diaz and P. Senac. Time stream Petri nets: a model for timed multimedia information. Lecture Notes in Computer Science, 815:219-238, 1994.
12. D. L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Workshop Automatic Verification Methods for Finite-State Systems, volume 407, pages 197-212, 1989.
13. G. Gardey, O. H. Roux, and O. F. Roux. A zone-based method for computing the state space of a time Petri net. In In Formal Modeling and Analysis of Timed Systems, (FORMATS'03), volume LNCS 2791. Springer, September 2003.
14. M. Hack. Petri net language. Computation Structures Group Memo 127, MIT, 1975.
15. R. Janicki and M. Koutny. Invariant semantics of nets with inhibitor arcs. In In CONCUR'91, Incs vol.527, pages 317-331, 1991.
16. R. Janicki and M. Koutny. Semantics of inhibitor nets. Information and Computation, 123(1):1-15, 1995.
17. R. Janicki and M. Koutny. On causality semantics of nets with priorities. Fundamenta Informaticae, 38(3):223-255, 1999.
18. Wael Khansa, J.-P. Denat, and S. Collart-Dutilleul. P-Time Petri Nets for manufacturing systems. In International Workshop on Discrete Event Systems, WODES'96, pages 94-102, Edinburgh (U.K.), august 1996.
19. K. G. Larsen, P. Pettersson, and W. Yi. Model-checking for real-time systems. In Fundamentals of Computation Theory, pages 62-88, 1995.
20. J. Lilius. Efficient state space search for time Petri nets. In MFCS Workshop on Concurrency '98, volume 18 of ENTCS. Elsevier, 1999.
21. D. Lime and O. (H.) Roux. Expressiveness and analysis of scheduling extended time Petri nets. In 5th IFAC International Conference on Fieldbus Systems and their Applications, (FET'03). Elsevier Science, July 2003.
22. D. Lime and O. (H.) Roux. State class timed automaton of a time Petri net. In 10th International Workshop on Petri Nets and Performance Models, (PNPM'03). IEEE Computer Society, September 2003.
23. M. Menasche. Analyse des réseaux de Petri temporisés et application aux systèmes distribués. PhD thesis, Université Paul Sabatier, Toulouse, France, 1982.
24. P. M. Merlin. A study of the recoverability of computing systems. PhD thesis, Department of Information and Computer Science, University of California, Irvine, CA, 1974.
25. Y. Okawa and T. Yoneda. Schedulability verification of real-time systems with extended time Petri nets. International Journal of Mini and Microcomputers, 18(3):148-156, 1996.
26. J.L. Peterson. Petri net theory and the modeling of systems. Prentice-Hall, NewYork, 1981.
27. M. Pezze and M. Toung. Time Petri nets: A primer introduction. Tutorial presented at the Multi-Workshop on Formal Methods in Performance Evaluation and Applications, Zaragoza, Spain, September 1999.
28. L. Popova. On time Petri nets. Journal on Information Processing and Cybernetics, EIK, 27(4):227-244, 1991.
29. C. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri nets. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 1974. Project MAC Report MAC-TR-120.
30. O. H. Roux and A.-M. Déplanche. A t-tinie Petri net extension for real time-task scheduling modeling. European Journal of Automation (JESA), 36(7), 2002.
31. J. Toussaint, F. Simonot-Lion, and Jean-Pierre Thomesse. Time constraint verification methods based on time Petri nets. In 6th Workshop on Future Trends in Distributed Computing Systems (FTDCS'97), pages 262-267, Tunis, Tunisia, 1997.
32. T. Yoneda and H. Ryuba. CTL model checking of time Petri nets using geometric regions. IEICE Transactions on Information and Systems, E99-D(3):297-396, march 1998.