Decidability and Complexity Results for Timed Automata via Channel Machines.

Parosh Aziz Abdulla Johann Deneux Joël Ouaknine James Worrell

Published in: ICALP (2005)

Keyphrases

timed automata
model checking
neural network
theorem proving
reachability analysis
computational cost
space complexity
worst case
description logics
image quality
query answering
multiple access