Is your model checker on time? On the complexity of model checking for timed modal logics

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

Volumn 1672, Issue , 1999, Pages 125-136

  Aceto, Luca ^a   Laroussinie, François ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SPECIFICATIONS; TEMPORAL LOGIC;

MODAL LOGIC; MODEL CHECKER; MU-CALCULUS; PROGRAM COMPLEXITY; STRUCTURAL COMPLEXITY; SYSTEM MODELING; TIMED AUTOMATA;

MODEL CHECKING;

EID: 0004765002     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_12     Document Type: Conference Paper

References (24)

1. L. Aceto, P. Bouyer, A. Burgueño, and K. G. Larsen, The power of reachability testing for timed automata, in Proc. of FSTTCS'98, LNCS 1530, December 1998, pp. 245-256.
2. L. Aceto, A. Burgueño, and K. G. Larsen, Model checking via reachability testing for timed automata, in Proc. of TACAS '98, LNCS 1384, April 1998, pp. 263-280.
3. R. Alur, Techniques for Automatic Verification of Real-time Systems, PhD thesis, Stanford University, 1991.
4. R. Alur, C. Courcoubetis, and D. Dill, Model-checking in dense real-time, Information and Computation, 104 (1993), pp. 2-34.
5. R. Alur and D. Dill, A theory of timed automata, Theoretical Computer Science, 126 (1994), pp. 183-235.
6. O. Bernholtz, M. Y. Vardi, and P. Wolper, An automata-theoretic approach to branching-time model checking, in Proc. of the 6th. International Conference on Computer-Aided Verification, CAV'94, D. Dill, ed., vol. 818 of Lecture Notes in Computer Science, California, USA, June 1994, Stanford, Springer-Verlag.
7. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer, Alternation, J. Assoc. Comput. Mach., 28 (1981), pp. 114-133.
8. E. M. Clarke, E. A. Emerson, and A. P. Sistla, Automatic verification of finite state concurrent system using temporal logic, ACM Trans, on Programming Languages and Systems, 8 (1986), pp. 244-263.
9. R. Cleaveland, A linear-time model-checking algorithm for the alternation-free modal μ-calculus, Formal Methods in Systems Design, 2 (1993), pp. 121-147.
10. C. Courcoubetis and M. Yannakakis, Minimum and maximum delay problems in real-time systems, Formal Methods in System Design, (1992), pp. 385-415.
11. S. Demri and P. Schnoebelen, The complexity of propositional linear temporal logics in simple cases (extended abstract), in Proc. 15th Ann. Symp. Theoretical Aspects of Computer Science (STACS'98), LNCS 1373, Paris, France, Feb. 1998, Springer Verlag, 1998, pp. 61-72.
12. S. Dziembowski, M. Jurdziński, and D. Niwiński, On the expression complexity of the modal μ-calculus model checking. Unpublished manuscript, November 1996.
13. E. A. Emerson, C. S. Jutla, and A. P. Sistla, On model-checking for fragments of μ-calculus, in Proceedings of the Fifth International Conference Computer Aided Verification, Elounda, Greece, July 1993, C. Courcoubetis, ed., vol. 697 of Lecture Notes in Computer Science, Springer-Verlag, 1993, pp. 385-396.
14. M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, J. Assoc. Comput. Mach., 32 (1985), pp. 137-161.
15. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic model checking for real-time systems, Information and Computation, 111 (1994), pp. 193-244.
16. D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science, 27 (1983), pp. 333-354.
17. F. Laroussinie and K. G. Larsen, CMC: A tool for compositional model- checking of real-time systems, in Proc. IFIP Joint Int. Conf. Formal Description Techniques & Protocol Specification, Testing, and Verification (FORTE-PSTV'98), Kluwer Academic Publishers, 1998, pp. 439-456.
18. F. Laroussinie, K. G. Larsen, and C. Weise, From timed automata to logic - and back, in Proc. of the 20th. International Symposium on Mathematical Foundations of Computer Science, MFCS'95, J. Wiedermann and P. Hájek, eds., vol. 969 of Lecture Notes in Computer Science, Prague, Czech Republic, August 28 - September 1 1995, Springer-Verlag, pp. 529-539.
19. K. G. Larsen, P. Pettersson, and W. Yi, Model-checking for real-time systems, in Proceedings of the 10th International Conference on Fundamentals of Computation Theory, H. R. (Ed.), ed., Dresden, Germany, August 1995, LNCS 965, pp. 62-88.
20. UPPAAL in a Nutshell, Journal of Software Tools for Technology Transfer, 1 (1997), pp. 134-152.
21. O. Lichtenstein and A. Pnueli, Checking that finite state concurrent programs satisfy their linear specification, in Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, Jan. 1985, pp. 97-107.
22. A. P. Sistla and E. M. Clarke, The complexity of prepositional linear temporal logics, J. Assoc. Comput. Mach., 32 (1985), pp. 733-749.
23. T.A. Henzinger and P.-H. Ho, and H. Wong-Toi, HyTech: A Model Checker for Hybrid Systems, Journal of Software Tools for Technology Transfer, 1 (1997), pp. 110-122.
24. S. Yovine, Kronos: A Verification Tool for real-Time Systems, Journal of Software Tools for Technology Transfer, 1 (1997), pp. 123-133.