On-the-fly TCTL model checking for Time Petri Nets using state class graphs

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn , Issue , 2006, Pages 111-120

  Hadjidj, Rachid ^a   Boucheneb, Hanifa ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

(PL) PROPERTIES; EXPERIMENTAL RESULTS; EXPLORATION TECHNIQUES; INTERNATIONAL CONFERENCES; MODEL CHECKING; ON THE FLY (OTF); PROPERTY (S); STATE EXPLOSION PROBLEMS; SYSTEM DESIGNS; TIME PETRI NETS; TIMED PETRI NETS (TPN) MODELS;

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL GEOMETRY; ERROR ANALYSIS; GRAPH THEORY; MARINE BIOLOGY; MODAL ANALYSIS; PETRI NETS; SYSTEMS ANALYSIS;

MODEL CHECKING;

EID: 45149134673     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2006.18     Document Type: Conference Paper

References (17)

1. R. Alur and D. Dill. Automata for modelling real-time systems. In Proc of ICALP90, volume 443 of LNCS, pages 322-335. Springer-Verlag, 1990.
2. G. Behrmann, J. Bengtsson, A. David, K. G. Larsen, P. Pettersson, and W. Yi. Uppaal implementation secrets. In Proc of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, pages 3-22. Springer-Verlag, 2002.
3. B. Berthomieu and M. Menasche. An enumerative approach for analyzing time Petri nets. In Proc of the IFIP 9th World Computer Congress, volume 9 of information Processing, pages 41-46. North Holland/IFIP, September 1983.
4. B. Berthomieu and F. Vernadat. State class constructions for branching analysis of time Petri nests. LNCS 2619, 2003.
5. A. Bouajjani, S. Tripakis, and S. Yovine. On-the-fly symbolic model checking for real-time systems. In Proc of RTSS97, pages 232-243. IEEE Comp. Soc. Press, 1997.
6. H. Boucheneb and G. Berthelot. Towards a simplified building of time Petri nets reachability graph. In Proc of the 5th int. Workshop on Petri Nets and Performance Models, pages 46-55, 1993.
7. H. Boucheneb and R. Hadjidj. Towards optimal CTL* model checking of time Petri nets. international workshop on discrete event systems, WODES 2004, May 19, REIMS-FRANCE.
8. H. Boucheneb and R. Hadjidj. Using inclusion abstraction to construct atomic state class graphs for time Petri nets. International Journal of Embedded Systems, issue 5/6, 2005.
9. F. Cassez and O. H. Roux. Structural translation from time Petri nets to timed automata. In Electronic Notes in Theoretical Computer Science. 128(6): 145-160, 2005.
10. E. M. Clarke, O. Grumberg, and D. Peled. Model checking. Press, Cambridge, MA, 1999.
11. G. Gardey, O. H. Roux, and O. F. Roux. Using zone graph method for computing the state space of a time Petri net. In Proc of FORMATS03, volume 2791 of LNCS. Springer-Verlag, 2004.
12. Z. Gu and K. Shin. Analysis of event-driven real-time systems with time Petri nets. In Proc of DIPES02, volume 219 of IFIP Conference Proceedings, pages 31-40. Kluwer, 2002.
13. R. Hadjidj and H. Boucheneb. Much compact time Petri net state class spaces useful to restore CTL* properties. In Proc of the fifth international conference on Application of Concurrency to System Design, ACSD 2005, IEEE Comp. Soc Press., 2005.
14. D. Lime and O. H. Roux. State class timed automaton of a time Petri net. In Proc of the 10th Int. Workshop on Petri Nets and Performance Models (PNPM03). IEEE Comp. Soc. Press, September 2003.
15. P. Merlin and D. J. Farber. Recoverability of communication protocols - implication of a theoretical study. IEEE Trans. on Communications, 24(9): 1036-1043, 1976.
16. C. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri nets. Technical Report MAC-TR-120, Massachusets Institute of Technology, February 1974.
17. T. Yoneda and H. Ryuba. CTL model checking of time Petri nets using geometric regions. IEICE Trans. Inf. and Syst., 3:1-10, 1998.