Automated verification of infinite state concurrent systems

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

Volumn 2328, Issue , 2002, Pages 247-255

  Dembiński, Piotr ^a   Penczek, Wojciech ^a   Półrola, Agata ^b  

^a POLISH ACADEMY OF SCIENCES   (Poland)

^b UNIVERSITY OF LODZ   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATED VERIFICATION; CONCURRENT PROGRAM; FINITE MODEL; INFINITE STATE CONCURRENT SYSTEMS; PARTITIONING ALGORITHMS; PARTITIONING TECHNIQUES; TIME PETRI NETS; TIMED AUTOMATA;

PETRI NETS;

EID: 84947587965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48086-2_27     Document Type: Conference Paper

References (11)

1. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi, An implementation of three algorithms for timing verification based on automata emptiness, Proc. of the 13th IEEE Real-Time Systems Symposium (RTSS’92), IEEE Comp. Soc. Press, 1992, pp. 157–166.
2. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi, Minimization of timed transition systems, Proc. of CONCUR’92, LNCS, vol. 630, Springer-Verlag, 1992, pp. 340–354.
3. M. C. Browne, E. M. Clarke, and O. Grumberg, Characterizing finite Kripke structures in propositional temporal logic, Theoretical Computer Science 59(1/2) (1988), 115–131.
4. A. Bouajjani, J-C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel, Minimal state graph generation, Science of Computer Programming 18 (1992), 247–269.
5. D. Bustan and O. Grumberg, Simulation based minimization, Proc. of the 17th Int. Conf. on Automated Deduction (ICAD’2000) (Pittsburgh), 2000, pp. 255–270.
6. D. Dill, Timing assumptions and verification of finite state concurrent systems, Automatic Verification Methods for Finite-State Systems, LNCS, vol. 407, Springer-Verlag, 1989, pp. 197-212.
7. U. Goltz, R. Kuiper, and W. Penczek, Propositional temporal logics and equivalences, Proc. of CONCUR’92, LNCS, vol. 630, Springer-Verlag, 1992, pp. 222–236.
8. O. Grumberg and D. E. Long, Model checking and modular verification, Proc. of CONCUR’91, LNCS, vol. 527, Springer-Verlag, 1991, pp. 250-265.
9. M. Henzinger, T. Henzinger, and P. Kopke, Computing simulations on finite and infinite graphs, Proc. of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS’95), 1995, pp. 453–462.
10. W. Penczek and A. Półrola, Abstractions and partial order reductions for checking branching properties of Time Petri Nets, Proc. of the Int. Conf. on Applications and Theory of Petri Nets (ICATPN’01), LNCS, vol. 2075, Springer-Verlag, 2001, pp. 323–342.
11. S. Tripakis and S. Yovine, Analysis of timed systems based on timeabstracting bisimulations, Proc. of CAV’96, LNCS, vol. 1102, Springer- Verlag, 1996, pp. 232–243.