Proceedings ArticleDOI
Computing reachability relations in timed automata
Catalin Dima
- pp 177-186
Reads0
Chats0
TLDR
An algorithmic calculus of the reachability relations on clock values defined by timed automata is given, by computing unions, compositions and reflexive-transitive closure (star) of "atomic" relations.Abstract:
We give an algorithmic calculus of the reachability relations on clock values defined by timed automata. Our approach is a modular one, by computing unions, compositions and reflexive-transitive closure (star) of "atomic" relations. The essential tool is a new representation technique for n-clock relations - the 2n-automata - and our strategy is to show the closure under union, composition and star of the class of 2n-automata that represent reachability relations in timed automata.read more
Citations
More filters
Book ChapterDOI
On sampled semantics of timed systems
Pavel Krcal,Radek Pelánek +1 more
TL;DR: The main technical contribution is decidability of non-emptiness of a timed automaton ω-language in some sampled semantics (this problem was previously wrongly classified as undecidable).
Book ChapterDOI
Distributed time-asynchronous automata
Catalin Dima,Ruggero Lanotte +1 more
TL;DR: It is shown that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection.
Book ChapterDOI
Thin and thick timed regular languages
Nicolas Basset,Eugene Asarin +1 more
TL;DR: It is shown that the entropy can be computed with a desired precision using discretization and thus it is computable, which closes a question left open in [3,4].
Reduction and Abstraction Techniques for Model Checking
TL;DR: The thesis contributes in several ways to the development of abstraction and reduction techniques, which are both practical and theoretically grounded, and provides two interesting results for timed automata: a decidability result for a non-emptiness problem of timedAutomata with sampled semantics and a new extrapolation technique for zone based abstractions of timed Automata.
References
More filters
Book
Dynamic Programming
TL;DR: The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Journal ArticleDOI
What is dynamic programming
TL;DR: Sequence alignment methods often use something called a 'dynamic programming' algorithm, which can be a good idea or a bad idea, depending on the method used.