Characteristic formulae for timed automata

RAIRO - Theoretical Informatics and Applications

Volumn 34, Issue 6, 2000, Pages 565-584

  Aceto, L ^a   Ingolfsdottir A ^a   Pedersen, M L ^a   Poulsen, J ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FORMAL LOGIC; GRAPH THEORY; SET THEORY; THEOREM PROVING;

CHARACTERISTIC FORMULA; LABELED TRANSITION SYSTEMS; TIMED AUTOMATA; TIMED BISIMULATION EQUIVALENCE;

AUTOMATA THEORY;

EID: 17844406626     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2000131     Document Type: Article

References (29)

1. Is your model checker on time? On the complexity of model checking for timed modal logics. Springer-Verlag, Berlin
2. A theory of timed automata
3. An efficiency preorder for processes
4. Bisimulation can't be traced
5. Characterizing finite Kripke structures in propositional temporal logic
6. Design and synthesis of synchronization skeletons using branching-time temporal logic
7. Computing behavioral relations, logically
8. A linear-time model-checking algorithm for the alternation-free modal μ-calculus
9. Determinacy → (observation equivalence = trace equivalence)
10. A modal characterization of observational congruence on finite terms of CCS
11. Algebraic laws for nondeterminism and concurrency
12. Formal verification of parallel programs
13. Results on the propositional mu-calculus
14. CMC: A tool for compositional model-checking of real-time systems
15. From timed automata to logic - and back
16. The state explosion problem from trace to bisimulation equivalence
17. Bisimulation through probabilistic testing
18. An algebraic definition of simulation between programs
19. Relating processes with respect to speed
20. Concurrency and automata on infinite sequences
21. Characteristic formulae for processes with divergence
22. A lattice-theoretical fixpoint theorem and its applications