16 search results - page 1 / 4 » Decidable Approximations on Generalized and Parameterized Di... |
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
FUIN
2006
13 years 4 months ago
2006
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of univers...
FAC
2008
13 years 4 months ago
2008
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
FORMATS
2010
Springer
13 years 2 months ago
2010
Springer
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...