Model checking timed automata with one or two clocks

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

Volumn 3170, Issue , 2004, Pages 387-401

  Laroussinie, F ^a   Markey, N ^a,b   Schnoebelen, Ph ^a  

^a CNRS   (France)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CLOCKS; POLYNOMIAL APPROXIMATION;

NP-HARD; POLYNOMIAL-TIME ALGORITHMS; PSPACE-COMPLETE; REACHABILITY; REACHABILITY PROBLEM; TIMED AUTOMATA; TIMING CONSTRAINTS;

MODEL CHECKING;

EID: 33244476377     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_25     Document Type: Article

References (20)

1. [ACD93] R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
2. [ACH94] R. Alur, C. Courcoubetis, and T. A. Henzinger. The observational power of clocks. In Proc. 5th Int. Conf. Theory of Concurrency (CONCUR'94), Uppsala, Sweden, Aug. 1994, volume 836 of Lecture Notes in Computer Science, pages 162-177. Springer, 1994.
3. [AD94] R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
4. [AFH96] R. Alur, T. Feder, and T. A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116-146, 1996.
5. [AH92] R. Alur and T. A. Henzinger. Logics and models of real time: A survey. In Real-Time: Theory in Practice, Proc. REX Workshop, Mook, NL, June 1991, volume 600 of Lecture Notes in Computer Science, pages 74-106. Springer, 1992.
6. [AH93] R. Alur and T. A. Henzinger. Real-time logics: Complexity and expressiveness. Information and Computation, 104(1):35-77, 1993.
7. [AH94] R. Alur and T. A. Henzinger. A really temporal logic. Journal of the ACM, 41(1):181-203, 1994.
8. [AL02] L. Aceto and F. Laroussinie. Is your model checker on time? On the complexity of model checking for timed modal logics. Journal of Logic and Algebraic Programming, 52-53:7-51, 2002.
9. [Alu91] R. Alur. Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Stanford Univ., August 1991. Available as Tech. Report STAN-CS-91-1378.
10. [Bou04] P. Bouyer. Forward analysis of updatable timed automata. Formal Methods in System Design, 24(3) :281-320, 2004.
11. [CC95] S. Campos and E. M. Clarke. Real-time symbolic model checking for discrete time models. In T. Rus and C. Rattray, editors, Theories and Experiences for Real-Time System Development, volume 2 of AMAST Series in Computing, pages 129-145. World Scientific, 1995.
12. [CGP99] E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
13. [CY92] C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. Formal Methods in System Design, 1(4):385-415, 1992.
14. [Dil90] D. L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Proc. Int. Workshop Automatic Verification Methods for Finite State Systems (CAV'89), Grenoble, June 1989, volume 407 of Lecture Notes in Computer Science, pages 197-212. Springer, 1990.
15. [Dim00] Catalin Dima. Real-time automata and the Kleene algebra of sets of real numbers. In Proc. of STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, volume 1770 of Lecture Notes in Computer Science, pages 279-289, 2000.
16. [Eme90] E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 16, pages 995-1072. Elsevier Science, 1990.
17. [GJ79] M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, 1979.
18. [Hen98] T. A. Henzinger. It's about time: real-time logics reviewed. In Proc. 9th Int. Conf. Concurrency Theory (CONCUR'98), Nice, France, Sep. 1998, volume 1466 of Lecture Notes in Computer Science, pages 439-454. Springer, 1998.
19. [HJ96] Dang Van Hung and Wang Ji. On the design of hybrid control systems using automata models. In Proc. 16th Conf. Found, of Software Technology and Theor. Comp. Sci. (FST&TCS'96), Hyderabad, India, Dec. 1996, volume 1180 of Lecture Notes in Computer Science, pages 156-167. Springer, 1996.
20. [LMS02] F. Laroussinie, N. Markey, and Ph. Schnoebelen. On model checking durational Kripke structures (extended abstract). In Proc. 5th Int. Conf. Foundations of Software Science and Computation Structures (FOSSACS'2002), Grenoble, France, Apr. 2002, volume 2303 of Lecture Notes in Computer Science, pages 264-279. Springer, 2002.