Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata.
Hongfei FuPublished in: HSCC (2013)
Keyphrases
- timed automata
- model checking
- reachability analysis
- theorem prover
- shortest path
- neural network
- probability distribution
- high speed
- theorem proving
- deterministic finite automaton
- probability theory
- conditional probabilities
- temporal logic
- power consumption
- theoretical framework
- mobile robot
- objective function
- genetic algorithm
- information retrieval