scispace - formally typeset
Book ChapterDOI

An Introduction to Timed Automata

Béatrice Bérard
- Vol. 433, pp 169-187
Reads0
Chats0
TLDR
Two techniques for the analysis of timed automata are presented: the zone graph and the region graph, which can be more efficient for reachability analysis and related problems but it is not always finite.
Abstract: 
We introduce timed automata and show how they can be used for the specification of timed systems. We also present some syntactical extensions useful for modeling and in particular networks of timed automata. Then we present two techniques for the analysis of timed automata: the zone graph and the region graph. The former can be more efficient for reachability analysis and related problems but it is not always finite. In contrast, the latter is a finite graph and can be used for model-checking. We compare the properties fulfilled by finite automata and timed automata emphasizing their main differences: languages of timed automata are not closed under complementation and the inclusion of languages is undecidable for timed automata.

read more

Citations
More filters

A determinizable class of timed automata

Rajeev Alur, +2 more
TL;DR: Event-recording timed automata (ERA) as mentioned in this paper is a class of timed transition automata that is expressive enough to model (finite) timed transition systems and determinizable and closed under all boolean operations.
Dissertation

Optimisation d'alignements d'un réseau de pipelines basée sur les algèbres tropicales et les approches génétiques

Karla Rossa Quintero Garcia
TL;DR: In this paper, a porte sur l’optimisation d’operations dans un terminal maritime petrolier en vue dassister les operateurs de supervision.
Book ChapterDOI

Fairness in Temporal Verification of Distributed Systems

Wiktor B. Daszczuk
TL;DR: The verification of deadlock freeness and distributed termination in distributed systems by Dedan tool is described, and the problem is solved by own temporal formulas evaluation algorithm, using breadth-first search and reverse reachability.
Proceedings ArticleDOI

Conformance testing of ARINC 653 compliance for a safety critical RTOS using UPPAAL model checker

Abhishek Singh, +2 more
TL;DR: In this paper, the authors propose a formal methods based technique for conformance testing of a safety critical RTOS to the ARINC 653 standard, which is illustrated in the context of HAL-OS, a proprietary RTOS used in avionics systems.
Posted Content

Automatic Translation of tock-CSP into Timed Automata.

Abdulrazaq Abba, +2 more
- 16 Aug 2020 - 
TL;DR: This work uses rules for translating tock-CSP into a network of small TA, which address the complexity of capturing the compositionality of tock -CSP, and uses mathematical proof to establish the correctness of the rules that will cover an infinite set of traces.
References
More filters
Journal ArticleDOI

A theory of timed automata

Rajeev Alur, +1 more
- 25 Apr 1994 - 
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.
Book ChapterDOI

A Tutorial on UPPAAL

Gerd Behrmann, +2 more
TL;DR: This is a tutorial paper on the tool Uppaal to be a short introduction on the flavor of timed automata implemented in the tool, to present its interface, and to explain how to use the tool.
Journal ArticleDOI

Symbolic model checking for real-time systems

Thomas A. Henzinger, +3 more
- 01 Jun 1994 - 
TL;DR: It is shown that the expressiveness of the timed μ-calculus is incomparable to theexpressiveness of timed CTL, which does not impair the symbolic verification of "implementable" real-time programs-those whose safety constraints are machine-closed with respect to diverging time and whose fairness constraints are restricted to finite upper bounds on clock values.
Journal ArticleDOI

Model-Checking in Dense Real-Time

Rajeev Alur, +2 more
TL;DR: An algorithm for model-checking, for determining the truth of a TCTL-formula with respect to a timed graph, is developed and it is argued that choosing a dense domain instead of a discrete domain to model time does not significantly blow up the complexity of the model- checking problem.
Book ChapterDOI

Automata for modeling real-time systems

Rajeev Alur, +1 more
TL;DR: To model the behavior of finite-state asynchronous real-time systems, the notion of timed Buchi automata (TBA) is proposed, coupled with a mechanism to express constant bounds on the timing delays between system events.