A full symbolic compositional reachability analysis of timed automata based on BDD.
Junwei DuHuiping ZhangGang YuXi WangPublished in: ICACI (2015)
Keyphrases
- reachability analysis
- timed automata
- binary decision diagrams
- model checking
- temporal logic
- theorem prover
- boolean functions
- first order logic
- theorem proving
- finite state machines
- markov decision processes
- symbolic representation
- high level
- state space
- search algorithm
- modal logic
- planning problems
- learning algorithm
- planning domains
- real time systems
- boolean formula
- incremental algorithms