Interrupt Timed Automata
Bérard, Béatrice; Haddad, Serge (2009), Interrupt Timed Automata, in de Alfaro, Luca, 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, Springer : Berlin, p. 197-211. http://dx.doi.org/10.1007/978-3-642-00596-1_15
TypeCommunication / Conférence
Conference title12th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2009)
Book titleFoundations 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
Book authorde Alfaro, Luca
Series titleLecture Notes in Computer Science
Number of pages471
MetadataShow full item record
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 ﬁxed, 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 ﬁxed (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.
Subjects / Keywordshybrid automata; timed automata; multi-task systems; interruptions; decidability of reachability
Showing items related by title and author.