Login / Signup
An Undecidable Problem for Timed Automata.
Anuj Puri
Published in:
Discret. Event Dyn. Syst. (1999)
Keyphrases
</>
timed automata
model checking
reachability analysis
sufficient conditions
theorem prover
np complete
theorem proving
temporal logic
real time systems
first order logic
databases
probabilistic model
case study
low cost
real time
computational complexity
data mining