Updatable timed automata
We investigate extensions of Alur and Dill's timed automata, based on the possibility to
update the clocks in a more elaborate way than simply reset them to zero. We call these …
update the clocks in a more elaborate way than simply reset them to zero. We call these …
Forward analysis of updatable timed automata
P Bouyer - Formal Methods in System Design, 2004 - Springer
Timed automata are a widely studied model. Its decidability has been proved using the so-
called region automaton construction. This construction provides a correct abstraction for the …
called region automaton construction. This construction provides a correct abstraction for the …
Untameable Timed Automata! Extended Abstract
P Bouyer - Annual Symposium on Theoretical Aspects of …, 2003 - Springer
Timed automata are a widely studied model for real-time systems. Since 8 years, several
tools implement this model and are successfully used to verify real-life examples. In spite of …
tools implement this model and are successfully used to verify real-life examples. In spite of …
Using non-convex approximations for efficient analysis of timed automata
The reachability problem for timed automata asks if there exists a path from an initial state to
a target state. The standard solution to this problem involves computing the zone graph of …
a target state. The standard solution to this problem involves computing the zone graph of …
Efficient emptiness check for timed Büchi automata
The Büchi non-emptiness problem for timed automata refers to deciding if a given
automaton has an infinite non-Zeno run satisfying the Büchi accepting condition. The …
automaton has an infinite non-Zeno run satisfying the Büchi accepting condition. The …
Efficient emptiness check for timed büchi automata
The Büchi non-emptiness problem for timed automata concerns deciding if a given
automaton has an infinite non-Zeno run satisfying the Büchi accepting condition. The …
automaton has an infinite non-Zeno run satisfying the Büchi accepting condition. The …
[图书][B] Timed automata may cause some troubles
P Bouyer - 2002 - brics.dk
Timed automata are a widely studied model. Its decidability has been proved using the so-
called region automaton construction. This construction provides a correct abstraction for the …
called region automaton construction. This construction provides a correct abstraction for the …
Efficient on-the-fly emptiness check for timed Büchi automata
F Herbreteau, B Srivathsan - International Symposium on Automated …, 2010 - Springer
The Büchi non-emptiness problem for timed automata concerns deciding if a given
automaton has an infinite non-Zeno run satisfying the Büchi accepting condition. The …
automaton has an infinite non-Zeno run satisfying the Büchi accepting condition. The …
Model checking timed safety instrumented systems
J Lahtinen - 2008 - aaltodoc.aalto.fi
Defects in safety-critical software systems can cause large economical and other losses.
Often these systems are far too complex to be tested extensively. In this work a formal …
Often these systems are far too complex to be tested extensively. In this work a formal …
On model-checking optimistic replication algorithms
H Boucheneb, A Imine - International Conference on Formal Methods for …, 2009 - Springer
Collaborative editors consist of a group of users editing a shared document. The Operational
Transformation (OT) approach is used for supporting optimistic replication in these editors. It …
Transformation (OT) approach is used for supporting optimistic replication in these editors. It …