Sciweavers

296 search results - page 3 / 60
» Linear Parametric Model Checking of Timed Automata
Sort
View
STACS
2001
Springer
14 years 1 days 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...
HYBRID
2003
Springer
14 years 24 days ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas
ENTCS
2006
125views more  ENTCS 2006»
13 years 7 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere
FORMATS
2004
Springer
14 years 1 months ago
Model-Checking for Weighted Timed Automata
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
Thomas Brihaye, Véronique Bruyère, J...
IJCSA
2007
84views more  IJCSA 2007»
13 years 7 months ago
Real Time Model Checking Using Timed Concurrent State Machines
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea...
Wiktor B. Daszczuk