Using zone graph method for computing the state space of a time petri net

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

Volumn 2791, Issue , 2004, Pages 246-259

  Gardey, Guillaume ^a   Roux, Olivier H ^a   Roux, Olivier F ^a  

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

Author keywords

Reachability Analysis; State Space; Time Petri Nets; Verification; Zone

Indexed keywords

STATE SPACE METHODS; TIME SHARING SYSTEMS; VERIFICATION; ZONING;

GRAPH METHODS; NEW EFFICIENT METHOD; ON THE FLIES; REACHABILITY; REACHABILITY ANALYSIS; TIME PETRI NETS; TIME PROPERTIES; TIMED AUTOMATA;

PETRI NETS;

EID: 35048818944     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40903-8_20     Document Type: Article

References (31)

1. [AD94] Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
2. [AJ01] Parosh Aziz Abdulla and Bengt Jonsson. Ensuring completeness of symbolic verification methods for infinite-state systems. Theoretical Computer Science, 256:145-167, 2001.
3. [AN01] Parosh Aziz Abdulla and Aletta 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.
4. [BC02] F. Boniol and F. Carcenac. Une étude de cas pour la vérification formelle de propriétés temporelles. FAC'2002, Mar 2002. http://www.laas.fr/ francois/SVF/FAC02.
5. [BD91] Bernard Berthomieu and Michel Diaz. Modeling and verification of time dependent systems using time petri nets. IEEE transactions on software engineering, 17(3):259-273, 1991.
6. [BDFP00] Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, and Antoine Petit. Are timed automata updatable? In Proc. 12th International Conference on Computer Aided Verification (CAV'2000), volume 1855 of LNCS, pages 464-479. Springer Verlag, July 2000.
7. [Bou02] Patricia Bouyer. Timed automata may cause some troubles. Technical report, LSV, July 2002.
8. [Bou03] Patricia Bouyer. Unteamable timed automata! In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2003), volume 2607 of LNCS, pages 620-631, Berlin, Germany, February 2003. Springer Verlag.
9. [BV] B. Berthomieu and F. Vernadat. TINA, http://www.laas.fr/tina.
10. [BV03] Bernard Berthomieu and François 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.
11. [CEP00] Luis Alejandro Cortes, Petru Eles, and Zebo Peng. Verification of embedded systems using a petri net based representation. In 13th International Symposium on System Synthesis (ISSS 2000), pages 149-155, Madrid, Spain, September 2000.
12. [CR03] Franck Cassez and Olivier (H.) Roux. Traduction structurelle des réseaux de petri temporels vers les automates temporisés. In 4ieme Colloque Francophone sur la Modélisation des Systèmes Réactifs, (MSR'03), Metz, France, oct 2003. To appear.
13. [dFRA00] David de Frutos Escrig, Valentín Valero Ruiz, and Olga 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.
14. [DS94] M. Diaz and P. Senac. Time stream petri nets: a model for timed multimedia information. Lecture Notes in Computer Science, 815:219-238, 1994.
15. [FS98] Alain Finkel and Philippe Schnoebelen. Fundamental structures in wellstructured infinite transitions systems. In 3rd Latin American Theoretical Informatics Symposium (LATIN'98), volume 1380 of Lecture Notes in Computer Science, pages 102-118, Campinas, Brazil, april 1998. Springer-Verlag.
16. [KDC96] Wael Khasa, 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.
17. [Lil99] Johan Lilius. Efficient state space search for time petri nets. In MFCS Workshop on Concurrency '98, volume 18 of ENTCS. Elsevier, 1999.
18. [LPY97] Kim G. Larsen, Paul Pettersson, and Wang Yi. UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer, 1(1-2):134-152, Oct 1997. http://www.uppaal.com/.
19. [LR03] Didier Lime and Olivier (H.) Roux. State class timed automaton of a time petri net. In The 10th International Workshop on Petri Nets and Performance Models, (PNPM'03). IEEE Computer Society, Sept. 2003. To appear.
20. [Men82] Miguel Menasche. Analyse des réseaux de Petri temporisés et application aux systèmes distribués. PhD thesis, Université Paul Sabatier, Toulouse, France, 1982.
21. [Mer74] 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.
22. [OY97] Yasukichi Okawa and Tomohiro Yoneda. Symbolic ctl model checking of time petri nets. In Scripta Technica, editor, Electronics and Communications in Japan, volume 80, pages 11-20, 1997.
23. [Pop91] Louchka Popova. On time petri nets. Journal Information Processing and Cybernetics, EIK, 27(4):227-244, 1991.
24. [Ram74] 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.
25. [RM94] Tomas G. Rokicki and Chris J. Myers. Automatic verification of timed circuits. In International Conference on Computer-Aided Verification (CAV'94), pages 468-480. Springer-Verlag, 1994.
26. [Rok93] Tomas G. Rokicki. Representing an Modeling Circuits. PhD thesis, Stanford University, 1993.
27. [Rom00] Romeo. http://www.irccyn.ec-nantes.fr/irccyn/d/fr/equipes/ tempsreel/logs. A tool for Time Petri Nets Analysis, 2000.
28. [SA01] A.T. Sava and H. Alla. Commande par supervision des systemes à évènements discrets temporisées. Modélisation des systèmes réactifs (MSR 2001), pages 71-86, 2001.
29. [TST97] Joël Toussaint, Françoise Simonot-Lion, and Jean-Pierre Thomesse. Time constraint verifications methods based time petri nets. In 6th Workshop on Future Trends in Distributed Computing Systems (FTDCS'97), pages 262-267, Tunis, Tunisia, 1997.
30. [Yov97] Sergio Yovine. Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer, 1(1-2):123-133, Oct 1997. http://www-verimag.imag.fr/TEMPORISE/kronos/.
31. [YR98] Tomohiro Yoneda and Hikaru Ryuba. Ctl model checking of time petri nets using geometric regions. IEICE Transactions on Information and Systems, E99-D(3):297-396, march 1998.