Lower-bound-constrained runs in weighted timed automata.
Patricia BouyerKim G. LarsenNicolas MarkeyPublished in: Perform. Evaluation (2014)
Keyphrases
- lower bound
- timed automata
- upper bound
- model checking
- reachability analysis
- branch and bound
- theorem prover
- lower and upper bounds
- branch and bound algorithm
- objective function
- theorem proving
- np hard
- worst case
- weighted sum
- upper and lower bounds
- order statistics
- optimal solution
- lagrangian relaxation
- lower bounding
- first order logic
- source code
- temporal logic
- probability distribution