Checking Timed Büchi Automata Emptiness Using LU-Abstractions.
Guangyuan LiPublished in: FORMATS (2009)
Keyphrases
- timed automata
- finite state machines
- tree automata
- model checking
- petri net
- high level
- cellular automata
- finite state
- regular expressions
- coalitional games
- verification method
- finite automata
- real world
- theorem prover
- lattice gas
- database
- formal language theory
- discrete event
- information gain
- data model
- databases
- consistency checking
- temporal logic
- markov chain
- learning algorithm
- probabilistic automata
- information retrieval