73 search results - page 1 / 15 » Path Compression in Timed Automata |
FUIN
2007
13 years 4 months ago
2007
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
ATVA
2008
Springer
13 years 6 months ago
2008
Springer
The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...
STACS
2001
Springer
13 years 8 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 ...
HYBRID
2001
Springer
13 years 8 months ago
2001
Springer
CAV
2001
Springer
13 years 8 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...