Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable.
Shankara Narayanan KrishnaLakshmi ManasaAshutosh TrivediPublished in: LATA (2015)
Keyphrases
- timed automata
- model checking
- datalog programs
- reachability analysis
- theorem prover
- first order logic
- transitive closure
- state space
- sufficient conditions
- theorem proving
- plan existence
- real time systems
- recursive queries
- temporal logic
- query answering
- plan generation
- np complete
- modal logic
- database
- information systems
- integrity constraints
- np hard
- special case
- search algorithm
- recursive functions
- artificial intelligence
- data sets