Lower-Bound Constrained Runs in Weighted Timed Automata.
Patricia BouyerKim Guldstrand LarsenNicolas MarkeyPublished in: QEST (2012)
Keyphrases
- timed automata
- lower bound
- model checking
- upper bound
- reachability analysis
- objective function
- theorem prover
- branch and bound
- lower and upper bounds
- branch and bound algorithm
- worst case
- optimal solution
- np hard
- theorem proving
- first order logic
- real time systems
- weighted sum
- sample complexity
- lower bounding
- machine learning
- upper and lower bounds
- real time
- temporal logic
- learning algorithm
- artificial intelligence
- probability distribution
- expert systems