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

Journal of Logic and Algebraic Programming

Volumn 52-53, Issue , 2002, Pages 7-51

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

^a AALBORG UNIVERSITY   (Denmark)

^b CNRS   (France)

Author keywords

Complexity of verification; Model checking; Timed automata; Timed modal logics

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED ANALYSIS; THEOREM PROVING;

TIMED AUTOMATA;

LOGIC PROGRAMMING;

EID: 0036655896     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1567-8326(02)00022-X     Document Type: Article

References (76)

1. The power of reachability testing for timed automata
2. Model checking via reachability testing for timed automata
3. Characteristic formulae for timed automata
4. Is your model checker on time?
5. Model-checking in dense real-time
6. A theory of timed automata
7. The benefits of relaxing punctuality
8. Logics and models of real time: A survey
9. Real-time logics: Complexity and expressiveness
10. A really temporal logic
11. Model checking and Boolean graphs
12. Partial model checking (extended abstract)
13. A linear algorithm to solve fixed-point equations on transition systems
14. Efficient timed reachability analysis using clock difference diagrams
15. Verification of an audio protocol with bus collision using Uppaal
16. Symbolic model checking without BDDs
17. Graph-based algorithms for boolean function manipulation
18. Alternation
19. A calculus of durations
20. Design and synthesis of synchronization skeletons using branching-time temporal logic
21. Automatic verification of finite state concurrent system using temporal logic
22. Formal methods: State of the art and future directions
23. A linear-time model-checking algorithm for the alternation-free modal μ-calculus
24. Minimum and maximum delay problems in real-time systems
25. The complexity of propositional linear temporal logics in simple cases (extended abstract)
26. Timing assumptions and verification of finite-state concurrent systems
27. On the power of bounded concurrency I: Finite automata
28. Efficient model checking in fragments of the propositional mu-calculus
29. On the complexity of verifying concurrent transition systems
30. Explicit clock temporal logic
31. Algebraic laws for nondeterminism and concurrency
32. Symbolic model checking for real-time systems
33. A framework for decidable metrical logics
34. Quantitative temporal logic
35. Automated analysis of an audio control protocol
36. The use of static constructs in a modal process logic
37. Deciding the winner in parity games is in UP ∩ co-UP
38. Reducibility among combinatorial problems
39. Lower bounds for natural proof systems
40. Results on the propositional μ-calculus
41. An automata-theoretic approach to branching-time model checking
42. Compositional model checking of real time systems
43. CMC: A tool for compositional model-checking of real-time systems
44. From timed automata to logic - And back
45. + and FCTL is hard
46. The state explosion problem from trace to bisimulation equivalence
47. Model-checking for real-time systems
48. UPPAAL in a Nutshell
49. Checking that finite state concurrent programs satisfy their linear specification
50. Hardware timing verification using KRONOS
51. Specification and verification of concurrent systems, in Cesar
52. Complexity of equivalence problems for concurrent systems of finite agents
53. Symbolic model checking for μ-calculus requires exponential time
54. Interval logics and their decision procedures. Part II: A real-time interval logic
55. Relationships between nondeterministic and deterministic tape complexities
56. The complexity of propositional linear temporal logics
57. Word problems requiring exponential time: Preliminary report
58. HyTech: A model checker for hybrid systems
59. A lattice-theoretical fixpoint theorem and its applications
60. Linear vs. branching time: A complexity-theoretic perspective
61. Reasoning about infinite computations
62. Specifying timed state sequences in powerful decidable logics and timed automata
63. Kronos: A verification tool for real-time systems