Reachability results for timed automata with unbounded data structures.
Ruggero LanotteAndrea Maggiolo-SchettiniAngelo TroinaPublished in: Acta Informatica (2010)
Keyphrases
- timed automata
- data structure
- model checking
- reachability analysis
- theorem prover
- state space
- first order logic
- efficient data structures
- transitive closure
- theorem proving
- real time systems
- data types
- neural network
- inference rules
- quadtree
- inverted index
- distributed systems
- dynamic programming
- data structures and algorithms
- data model
- data mining
- kd trees
- real time