Date
2009
Collection title
Lecture Notes in Computer Science
Collection Id
5504
Dewey
Informatique générale
Sujet
hybrid automata; timed automata; multi-task systems; interruptions; decidability of reachability
Conference name
12th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2009)
Conference date
03-2009
Conference city
York
Conference country
Royaume-Uni
Book title
Foundations of Software Science and Computational Structures 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings
Author
de Alfaro, Luca
Publisher
Springer
Publisher city
Berlin
Year
2009
Pages number
471
ISBN
978-3-642-00595-4
Author
Bérard, Béatrice
Haddad, Serge
Type
Communication / Conférence
Item number of pages
197-211
Abstract (EN)
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.
