On Termination and Boundedness of Nested Updatable Timed Automata.
Yuwei WangXiuting TaoGuoqiang LiPublished in: SOFL+MSVL (2016)
Keyphrases
- timed automata
- active rules
- model checking
- theorem prover
- term rewriting
- reachability analysis
- theorem proving
- termination analysis
- sufficient conditions
- rewrite systems
- first order logic
- integrity constraints
- active databases
- data sets
- database
- deductive databases
- relational databases
- real time systems
- hierarchical data
- data mining
- control flow
- data structure
- neural network