State class constructions for branching analysis of time Petri nets

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

Volumn 2619, Issue , 2003, Pages 442-457

  Berthomieu, Bernard ^a   Vernadat, François ^a  

^a LAAS CNRS   (France)

Author keywords

Bisimulation; Branching time temporal properties; Model checking; Real time systems modeling and verification; State classes; Time Petri nets

Indexed keywords

COMPUTATION THEORY; INTERACTIVE COMPUTER SYSTEMS; MODEL CHECKING; PETRI NETS; TEMPORAL LOGIC;

BISIMULATIONS; BRANCHING ANALYSIS; BRANCHING TIME; COMPUTING EXPERIMENTS; INFINITE STATE SPACE; STATE CLASSES; TEMPORAL PROPERTY; TIME PETRI NETS;

REAL TIME SYSTEMS;

EID: 18944397671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_33     Document Type: Article

References (15)

1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proc. 5th IEEE Symposium on Logic in Computer Science, pages 414-425, june 1990.
2. R. Alur, C. Courcoubetis, N. Halbwachs, D.L. Dill, and H. Wong-Toi. Minimization of timed transition systems. In CONCUR 92: Theories of Concurrency, Springer LNCS 630, pages 340-354, 1996.
3. M. C. Browne, E. M. Clarke, and O. Grümberg. Characterizing finite kripke structures in propositional temporal logics. Theoretical Computer Science, 59:115-131, 1988.
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, March 1991.
5. B. Berthomieu. La méthode des classes d'états pour l'analyse des réseaux temporels - mise en œuvre, extension à la multi-sensibilisation. In Proc. Modélisation des Systèmes Réactifs, Toulouse, France, October 2001.
6. B. Berthomieu. The Tina V2 Toolbox. http://www.laas.fr/tina, LAAS/CNRS, 2001.
7. B. Berthomieu and M. Menasche. An enumerative approach for analyzing time Petri nets. IFIP Congress Series, 9:41-46, 1983.
8. J-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP: A protocol validation and verification toolbox. In 8th Conference on Computer-Aided Verification, CAV'96, Springer LNCS 1102, July 1996.
9. P. K. Kanellakis and S. A. Smolka. Ccs expressions, finite state processes, and three problems of equivalence. Information and Computation, 86:43-68, 1990.
10. R. De Nicola and F. Vandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458-487, 1995.
11. W. Penczek and A. Półrola. Abstraction and partial order reductions for checking branching properties of time petri nets. In Proc. of ICATPN, Springer LNCS 2075, pages 323-342, 2001.
12. P. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
13. S. Tripakis and S. Yovine. Analysis of timed systems based on time-abstracting bisimulations. In 8th Conference Computer-Aided Verification, CAV'96, Springer LNCS 1102, pages 232-243, jul 1996.
14. S. Yovine. Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer, 1(1), 1997.
15. T. Yoneda and H. Ryuba. CTL model checking of Time Petri nets using geometric regions. IEEE Transactions on Information and Systems, E99-D(3):1-10, 1998.