Bounded Determinization of Timed Automata with Silent Transitions.

Florian Lorber Amnon Rosenmann Dejan Nickovic Bernhard K. Aichernig

Published in: FORMATS (2015)

Keyphrases

timed automata
model checking
reachability analysis
theorem prover
first order logic
real time systems
theorem proving
temporal logic
asymptotically optimal
information systems
similarity measure
special case
bounded treewidth