𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Timed CSP = Closed Timed Automata1

✍ Scribed by Joël Ouaknine; James Worrell

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
257 KB
Volume
68
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

✦ Synopsis

We study the expressive power of an augmented version of Timed CSP and show that it is precisely equal to that of closed timed automata-timed automata with closed invariant and enabling clock constraints. We also show that this new version of Timed CSP is expressive enough to capture the most widely used specifications on timed systems as refinements between processes, and moreover that refinement checking is amenable to digitisation analysis. As a result, we are able to verify some of the most important timed specifications, including branching-time liveness properties such as timestop-freedom and constant availability, using the model checker FDR (a commercial product of Formal Systems (Europe) Ltd.).

📜 SIMILAR VOLUMES

Distributed Timed Automata
Distributed Timed Automata
✍ Padmanabhan Krishnan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 921 KB
Concurrency in timed automata
Concurrency in timed automata
✍ Ruggero Lanotte; Andrea Maggiolo-Schettini; Simone Tini 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 373 KB

We introduce Concurrent Timed Automata (CTAs) where automata running in parallel are synchronized. We consider the subclasses of CTAs obtained by admitting, or not, diagonal clock constraints and constant updates, and by letting, or not, sequential automata to update the same clocks. We prove that s

Extending Timed Automata for Composition
Extending Timed Automata for Compositional Modeling Healthy Timed Systems
✍ Víctor Braberman; Alfredo Olivero 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 382 KB

We introduce the notion of Timed I/O Components as Timed Automata "à la" Alur \& Dill where an "admissible" I/O interface is declared. That notion has, what we consider, a key modeling property: non-zeno preservation under syntacticallycheckable "I/O compatibility" among interacting components. Also

Finite automata on timed ω-trees
Finite automata on timed ω-trees
✍ Salvatore La Torre; Margherita Napoli 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 264 KB

In the last decade Alur and Dill introduced a model of automata on timed !-sequences which extends the traditional models of ÿnite automata. In this paper, we present a theory of timed !-trees which extends both the theory of timed !-sequences and the theory of !-trees. The main motivation is to int