Minimum-Cost Reachability for Priced Timed Automata.
Gerd BehrmannAnsgar FehnkerThomas HuneKim Guldstrand LarsenPaul PetterssonJudi RomijnFrits W. VaandragerPublished in: HSCC (2001)
Keyphrases
- minimum cost
- timed automata
- model checking
- reachability analysis
- np hard
- approximation algorithms
- theorem prover
- network flow
- network flow problem
- state space
- theorem proving
- spanning tree
- network simplex algorithm
- minimum cost flow
- capacity constraints
- real time systems
- first order logic
- undirected graph
- special case
- machine learning
- distributed systems
- real time