Sciweavers

Share
73 search results - page 1 / 15
» Path Compression in Timed Automata
Sort
View
FUIN
2007
116views more  FUIN 2007»
11 years 5 months ago
Path Compression in Timed Automata
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...
Agata Janowska, Wojciech Penczek
ATVA
2008
Springer
102views Hardware» more  ATVA 2008»
11 years 7 months ago
Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
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...
Farn Wang
STACS
2001
Springer
11 years 10 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...
HYBRID
2001
Springer
11 years 10 months ago
Optimal Paths in Weighted Timed Automata
Rajeev Alur, Salvatore La Torre, George J. Pappas
CAV
2001
Springer
107views Hardware» more  CAV 2001»
11 years 10 months ago
Job-Shop Scheduling Using Timed Automata
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...
Yasmina Abdeddaïm, Oded Maler
books