Epsilon-transitions in Concurrent Timed Automata.

Ruggero Lanotte Andrea Maggiolo-Schettini Simone Tini

Published in: Inf. Process. Lett. (2004)

Keyphrases

timed automata
model checking
reachability analysis
theorem prover
theorem proving
first order logic
temporal logic
real time systems
complexity analysis
concurrent execution
mutual exclusion
hybrid automata
neural network
long running
state transitions
low cost
multiscale
computer vision