Checking ACTL* Properties of Discrete Timed Automata via Bounded Model Checking

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

Volumn 2791, Issue , 2004, Pages 18-33

  Woźna, Bozena ^a   Zbrzezny, Andrzej ^a  

^a PU   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS; TIME SHARING SYSTEMS;

BOUNDED MODEL CHECKING; SYMBOLIC MODEL CHECKERS; TEMPORAL PROPERTY; TIMED AUTOMATA;

MODEL CHECKING;

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

References (30)

1. R. Alur, C. Courcoubetis, and D. Dill. Model checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
2. G. Audemard, A. Cimatti, A. Kornilowicz, and R. Sebastiani. Bounded model checking for timed systems. In Proc. of RT-TOOLS'02, 2002.
3. M. Benedetti and Alessandro Cimatti. Bounded Model checking for Past LTL. In Proc. of TACAS'03, vol. 2619 of LNCS, Springer-Verlag, 2003.
4. J. Bengtsson, B. Jonsson, J. Lilius, and W. Yi. Partial order reductions for timed systems. In Proc. of CONCUR'98, vol. 1466 of LNCS. Springer-Verlag, 1998.
5. D. Beyer. Improvements in BDD-based reachability analysis of Timed Automata. In Proc. of FME'01, vol. 2021 of LNCS. Springer-Verlag, 2002.
6. A. Biere, A. Cimatti, E. Clarke, M.Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proc. of DAC'99, 1999.
7. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. of TACAS'99, vol. 1579 of LNCS. Springer-Verlag, 1999.
8. M. Bozga, O. Maler, and S. Tripakis. Efficient verification of Timed Automata using dense and-discrete time semantics. In Proc. of CHARME'99, 1999.
9. E. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded model checking using satisfiability solving. Formal Methods in System Design, 19(1):7-34, 2001.
10. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
11. D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems: Abstractions preserving ACTL*, ECTL* and CTL*. In Proceedings of PROCOMET'94. Elsevier Science Publishers, 1994.
12. C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In Proc. of TACAS'98, vol. 1384 of LNCS. Springer-Verlag, 1998.
13. P. Dembiński, A. Janowska, P. Janowski, W. Penczek, A. Półrola, M. Szreter, B. Woźna and A. Zbrzezny. √erics: A Tool for Verifying Timed Automata and Estelle Specifications. In Proc. of TACAS'03, vol. 2619 of LNCS. Springer-Verlag, 2003.
14. L. de Moura, H. Rueß, and M. Sorea. Lazy theorem proving for bounded model checking over infinite domains. In Proc. of CADE'02, vol. 2392 of LNCS. Springer-Verlag, 2002.
15. E. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9:105-131, 1995.
16. O. Grumberg and D. E. Long. Model checking and modular verification. In Proc. of CONCUR'91, vol. 527 of LNCS. Springer-Verlag, 1991.
17. K. Heljanko. Bounded reachability checking with process semantics. In Proc. of CONCUR'01, vol. 2154 of LNOS. Springer-Verlag, 2001.
18. K. Heljanko and I. Niemelä. Bounded LTL model checking with stable models. In Proc. of LPNMR'2001, vol. 2173 of LNCS. Springer-Verlag, 2001.
19. K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.
20. P. Niebert, M. Mahfoudh, E. Asarin, M. Bozga, O. Maler, and N. Jain. Verification of Timed Automata via Satisfiability Checking. In Proc. of FTRTFT'02, vol. 2469 of LNCS. Springer-Verlag, 2002.
21. D. Peled. Partial order reduction: Linear and branching temporal logics and process algebras. In Proc. of POMIV'96, vol. 29 of ACM/AMS DIMACS Series. Amer. Math. Soc., 1996.
22. W. Penczek, M. Szreter, R. Gerth, and R. Kuiper. Improving partial order reductions for universal branching time properties. Fundamenta Informaticae, 43:245-267, 2000.
23. W. Penczek, B. Wozna, and A. Zbrzezny. Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae, 51(1-2):135-156, June 2002.
24. W. Penczek, B. Wozna, and A. Zbrzezny. SAT-Based Bounded Model Checking for the Universal Fragment of TCTL. Technical Report 947, ICS PAS, 2002.
25. W. Penczek, B. Wozna, and A. Zbrzezny. Towards bounded model checking for the universal fragment of TCTL. In Proc. of FTRTFT'02, vol. 2469 of LNCS. Springer-Verlag, 2002.
26. Maria Sorea. Bounded model checking for timed automata. In Proc. of MTCS'02, vol. 68(5) of ENTCS. Elsevier Science Publishers, 2002.
27. S. Tripakis and S. Yovine. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design, 18(1):25-68, 2001.
28. P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In Proc. of CONCUR'93, vol. 715 of LNCS. Springer-Verlag, 1993.
29. B. Woźna, W. Penczek, and A. Zbrzezny. Reachability for timed systems based on SAT-solvers. In Proc. of CS&P'02, vol. II of Informatik-Berichte Nr 161. Humboldt University, 2002.
30. B. Woźna and A. Zbrzezny. Reaching the limits for Bounded Model Checking. Technical Report 958, ICS PAS, 2003.