Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.
Véronique BruyèreEmmanuel Dall'OlioJean-François RaskinPublished in: STACS (2003)
Keyphrases
- timed automata
- model checking
- presburger arithmetic
- quantifier elimination
- temporal logic
- reachability analysis
- algebraic structure
- first order logic
- satisfiability problem
- model checker
- decision procedures
- formal verification
- computation tree logic
- finite state machines
- theorem proving
- modal logic
- verification method
- formal methods
- cardinality constraints
- functional programming
- constraint propagation
- theorem prover
- real time
- description logics
- expert systems