Reachability Analysis for Timed Automata Using Partitioning Algorithms.
Agata PólrolaWojciech PenczekMaciej SzreterPublished in: Fundam. Informaticae (2003)
Keyphrases
- reachability analysis
- timed automata
- model checking
- incremental algorithms
- markov decision processes
- computational complexity
- learning algorithm
- computationally efficient
- optimization problems
- linear program
- theoretical analysis
- first order logic
- markov chain
- theorem prover
- computational cost
- evolutionary algorithm
- real time