Decidable verification for reducible timed automata specified in a first order logic with time

Theoretical Computer Science

Volumn 275, Issue 1-2, 2002, Pages 347-388

  Beauquier, Danièle ^a   Slissenko, Anatol ^a  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

Decidable class; First order logic; Timed automata; Verification

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; FORMAL LOGIC; MATHEMATICAL MODELS; SEMANTICS;

FIRST ORDER TIMED LOGIC (FOTL);

AUTOMATA THEORY;

EID: 0037187379     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00186-4     Document Type: Article

References (25)

1. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
2. A theory of timed automata
3. The benefits of relaxing punctuality
4. Pumping lemmas for timed automata
5. The railroad crossing problem: Towards semantics of timed algorithms and their model-checking in high-level languages
6. Decidable classes of the verification problem in a timed predicate logic
7. A first order logic for specification of timed algorithms: Basic properties and a decidable class
8. Automated temporal reasoning about reactive systems
9. Parametric quantitative temporal reasoning
10. The railroad crossing problem: An experiment with instantaneous actions and immediate reactions
11. Complexity of deciding Tarski algebra
12. Time and probability in formal design of distributed systems
13. It's about time: Real-time logics reviewed
14. From quantity to quality
15. The generalized railroad crossing: A case study in formal verification of real-time systems
16. Formal verification of real-time systems using timed automata
17. A framework for decidable metrical logics
18. Quantitative temporal logic
19. Automata over continuous time
20. Expressive completeness of duration calculus
21. On the computational complexity and geometry of the first-order theory of the reals, parts 1-3
22. Automata and hybrid systems