Sciweavers

697 search results - page 2 / 140
» Implementation of Timed Automata: An Issue of Semantics or M...
Sort
View
BMCBI
2004
121views more  BMCBI 2004»
13 years 5 months ago
Asynchronous adaptive time step in quantitative cellular automata modeling
Background: The behaviors of cells in metazoans are context dependent, thus large-scale multicellular modeling is often necessary, for which cellular automata are natural candidat...
Hao Zhu, Peter Y. H. Pang, Yan Sun, Pawan Dhar
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 6 days ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
FORMATS
2004
Springer
13 years 10 months ago
Robustness and Implementability of Timed Automata
In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller. We sh...
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jea...
LICS
2003
IEEE
13 years 10 months ago
Revisiting Digitization, Robustness, and Decidability for Timed Automata
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...
Joël Ouaknine, James Worrell
CONCUR
1999
Springer
13 years 9 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea