Interrupt Timed Automata

Authors:
Beatrice Bérard;Serge Haddad
Affiliations:
Université Pierre & Marie Curie, LIP6/MoVe, CNRS UMR, Paris, France 7606;Ecole Normale Supérieure de Cachan, LSV, CNRS UMR, Cachan, France 8643
Venue:
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Year:
2009

Citing 14
Cited 1

A theory of timed automata

Theoretical Computer Science
The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
Reachability analysis of dynamical systems having piecewise-constant derivatives

Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?

Journal of Computer and System Sciences
Decidable integration graphs

Information and Computation
Characterization of the expressive power of silent transitions in timed automata

Fundamenta Informaticae
Symbolic Reachability Computation for Families of Linear Vector Fields

Journal of Symbolic Computation
Controlled Timed Automata

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Impressive Power of Stopwatches

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A New Class of Decidable Hybrid Systems

HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
From Timed to Hybrid Systems

Proceedings of the Real-Time: Theory in Practice, REX Workshop
Forward Analysis of Updatable Timed Automata

Formal Methods in System Design
Algorithmic analysis of polygonal hybrid systems, part I: Reachability

Theoretical Computer Science
On model-checking timed automata with stopwatch observers

Information and Computation

Interrupt Timed Automata: verification and expressiveness

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single processor environment. This model is a subclass of hybrid automata. While reachability is undecidable for hybrid automata we show that in ITA the reachability problem is in 2-EXPSPACE and in PSPACE when the number of clocks is fixed, with a procedure based on a generalized class graph. Furthermore we consider a subclass ITA*** which still describes usual interrupt systems and for which the reachability problem is in NEXPTIME and in NP when the number of clocks is fixed (without any class graph). There exist languages accepted by an ITA*** but neither by timed automata nor by controlled real-time automata (CRTA), another extension of timed automata. However we conjecture that CRTA is not contained in ITA. So, we combine ITA with CRTA in a model which encompasses both classes and show that the reachability problem is still decidable.