Sciweavers

52 search results - page 4 / 11
» Verifying Linear Duration Constraints of Timed Automata
Sort
View
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
14 years 9 days ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
RTCSA
2008
IEEE
14 years 2 months ago
Verification of COMDES-II Systems Using UPPAAL with Model Transformation
COMDES-II is a component-based software framework intended for Model Integrated Computing (MIC) of embedded control systems with hard real-time constraints. We present a transforma...
Xu Ke, Paul Pettersson, Krzysztof Sierszecki, Chri...
CODES
2008
IEEE
13 years 10 months ago
Model checking SystemC designs using timed automata
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...
Paula Herber, Joachim Fellmuth, Sabine Glesner
STACS
2001
Springer
14 years 1 months ago
On Presburger Liveness of Discrete Timed Automata
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
Zhe Dang, Pierluigi San Pietro, Richard A. Kemmere...
ACSD
2006
IEEE
129views Hardware» more  ACSD 2006»
14 years 2 months ago
Extended Timed Automata and Time Petri Nets
Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability...
Patricia Bouyer, Pierre-Alain Reynier, Serge Hadda...