Lower and upper bounds in zone-based abstractions of timed automata.
Gerd BehrmannPatricia BouyerKim Guldstrand LarsenRadek PelánekPublished in: Int. J. Softw. Tools Technol. Transf. (2006)
Keyphrases
- lower and upper bounds
- timed automata
- model checking
- lower bound
- upper bound
- reachability analysis
- theorem prover
- upper and lower bounds
- high level
- lagrangian relaxation
- theorem proving
- valid inequalities
- real time systems
- temporal logic
- machine learning
- probability distribution
- np hard
- optimal solution
- artificial intelligence