State space computation and analysis of Time Petri Nets

Theory and Practice of Logic Programming

Volumn 6, Issue 3, 2006, Pages 301-320

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

^a CNRS   (France)

Author keywords

Bisimulation; Reachability analysis; Time Petri nets; Timed automata; Zones

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATION THEORY; GRAPH THEORY; REAL TIME SYSTEMS; STATE SPACE METHODS;

BISIMULATION; REACHABILITY ANALYSIS; TIME PETRI NETS; TIMED AUTOMATA; ZONES;

PETRI NETS;

EID: 33646680555     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S147106840600264X     Document Type: Conference Paper

References (30)

1. ABDULLA, P. A. AND JONSSON, B. 1998. Ensuring completeness of symbolic verification methods for infinite-state systems. Theoretical Computer Science 256, 145-167.
2. ABDULLA, P. A. AND NYLÉN, A. 2001. Timed petri nets and bqos. 22nd International Conference on Application and Theory of Petri Nets (ICATPN'01). Lecture Notes in Computer Science, vol. 2075. Springer-Verlag, pp. 53-70.
3. ALUR, R. AND DILL, D. L. 1994. A theory of timed automata. Theoretical Computer Science 126, 2, 183-235.
4. BERTHOMIEU, B. AND DIAZ, M. 1991. Modeling and verification of time dependent systems using time petri nets. IEEE Transactions on Software Engineering 17, 3 (March), 259-273.
5. BERTHOMIEU, B. AND VERNADAT, F. 2003. State class constructions for branching analysis of time petri nets. 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2003). Lecture Notes in Computer Science, vol. 2619. Springer-Verlag, pp. 442-457.
6. BOUYER, P. 2002. Timed automata may cause some troubles. Technical report, LSV.
7. BOUYER, P. 2003. Unteamable timed automata! Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2003). LNCS. vol. 2607. Springer-Verlag, pp. 620-631.
8. CASSEZ, F. AND ROUX, O. H. 2004. Structural translation from time Petri nets to timed automata. Fourth International Workshop on Automated Verification of Critical Systems (AVoCS'04). London (UK).
9. CORTS, L. A., ELES, P. AND PENG, Z. 2000. Verification of embedded systems using a petri net based representation. 13th International Symposium on System Synthesis (ISSS 2000). Madrid, Spain, pp. 149-155.
10. DAWS, C. AND YOVINE, S. 1996. Reducing the number of clock variables of timed automata. 17th IEEE Real Time Systems Symposium, RTSS'96. IEEE Computer Society Press.
11. DE FRUTOS ESCRIG, D., RUIZ, V. V. AND ALONSO, O. M. 2000. Decidability of properties of timed-arc petri nets. 21st International Conference on Application and Theory of Petri Nets (ICATPN'00). Lecture Notes in Computer Science, vol. 1825. Springer-Verlag, pp. 187-206.
12. DIAZ, M. AND SENAC, P. 1994. Time stream petri nets: a model for timed multimedia information. 15th International Conference on Application and Theroy of Petri Nets. LNCS, vol. 815. Springer-Verlag, pp. 219-238.
13. FINKEL, A. AND SCHNOEBELEN, P. 1998. Fundamental structures in well-structured infinite transitions systems. 3rd Latin American Theoretical Informatics Symposium (LATIN'98). Lecture Notes in Computer Science, vol. 1380. Springer-Verlag, pp. 102-118.
14. GARDEY, G., ROUX, O. H. AND F.ROUX, O. 2003. Using zone graph method for computing the state space of a time petri net. In Formal Modeling and Analysis of Timed Systems (FORMATS'2003). LNCS. Springer-Verlag.
15. KHANSA, W., DENAT, J.-P. AND COLLART-UUTILLEUL, S. 1996. P-time petri nets for manufacturing systems. In International Workshop on Discrete Event Systems, WODES'96, pp. 94-102.
16. LARSEN, K. G., PETTERSSON, P. AND YI, W. 1997. UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1, 1-2, 134-152.
17. LILIUS, J. 1999. Efficient state space search for time petri nets. MFCS Workshop on Concurrency '98. ENTCS, vol. 18. Elsevier.
18. LIME, D. AND Roux, O. H. 2003. State class timed automaton of a time petri net. The 10th International Workshop on Petri Nets and Performance Models, (PNPM'03). IEEE Computer Society.
19. MENASCHE, M. 1982. Analyse des rseaux de petri temporiss et application aux systmes distribus. PhD thesis, Universit Paul Sabatier, Toulouse, France.
20. MERLIN, P. M. 1974. A study of the recoverability of computing systems. PhD thesis, Department of Information and Computer Science, University of California, Irvine, CA.
21. OKAWA, Y. AND YONEDA, T. 1997. Symbolic ctl model checking of time petri nets. Electronics and Communications in Japan, S. Technica, Ed. Vol. 80. pp. 11-20.
22. POPOVA, L. 1991. On time petri nets. Journal Information Processing and Cybernetics, EIK 27.4, 227-244.
23. RAMCHANDANI, C. 1974. Analysis of asynchronous concurrent systems by timed Petri nets. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA. Project MAC Report MAC-TR-120.
24. ROKICKI, T. G. 1993. Representing an modeling circuits. PhD thesis, Stanford University.
25. ROKICKI, T. G. AND MYERS, C. J. 1994. Automatic verification of timed circuits. 6th International Conference on Computer-Aided Verification (CAV94). LNCS, vol. 818. Springer-Verlag, pp. 468-480.
26. ROMEO. 2003. http://www.irccyn.ec-nantes.fr/irccyn/d/fr/equipes/ tempsreel/logs. A tool for Time Pefri Nets Analysis.
27. SAVA, A. T. AND ALLA, H. 2001. Commande par supervision des systmes vnements discrets temporises. Modlisation des svstmes ractifs (MSR 2001), 71-86.
28. TOUSSAINT, J., SIMONOT-LION, F. AND THOMESSE, J.-P. 1997. Time constraint verifications methods based time petri nets. In 6th Workshop on Future Trends in Distributed Computing Systems (FTDCS'97). Tunis, Tunisia, pp. 262-267.
29. YONEDA, T. AND RYUBA, H. 1998. Ctl model checking of time petri nets using geometric regions. IEICE Transactions on Information and Systems E99-D, 3, 297-396.
30. YOVINE, S. 1997. Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer 1, 1-2, 123-133.