Decidable Approximations on Generalized and Parameterized Discrete Timed Automata.
Zhe DangOscar H. IbarraRichard A. KemmererPublished in: COCOON (2001)
Keyphrases
- timed automata
- first order logic
- model checking
- reachability analysis
- theorem prover
- discrete version
- theorem proving
- discrete geometry
- data sets
- finite number
- transitive closure
- real time systems
- linear time temporal logic
- continuous data
- finite dimensional
- efficient computation
- inference rules
- temporal logic
- closed form
- expressive power