Sciweavers

3229 search results - page 71 / 646
» The Theory of Timed Automata
Sort
View
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
15 years 7 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
FOSSACS
2007
Springer
15 years 11 months ago
Model-Checking One-Clock Priced Timed Automata
Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Ma...
FSTTCS
2007
Springer
15 years 11 months ago
Probabilistic and Topological Semantics for Timed Automata
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
SEFM
2005
IEEE
15 years 11 months ago
Specifying Urgency in Timed I/O Automata
Biniam Gebremichael, Frits W. Vaandrager