Heuristics for Probabilistic Timed Automata with Abstraction Refinement.
Luis María Ferrer FioritiHolger HermannsPublished in: MMB/DFT (2012)
Keyphrases
- timed automata
- reachability analysis
- model checking
- theorem prover
- probabilistic model
- theorem proving
- heuristic search
- information theoretic
- real time systems
- generative model
- first order logic
- uncertain data
- real time
- admissible heuristics
- heuristic methods
- posterior probability
- bayesian networks
- neural network
- context sensitive
- search strategies
- data driven
- evolutionary algorithm
- search space
- heuristic rules
- data abstraction
- probabilistic approaches
- database