
Interrupt Timed Automata
Bérard, Béatrice; Haddad, Serge (2009), Interrupt Timed Automata, dans 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
Voir/Ouvrir
Type
Communication / ConférenceDate
2009Titre du colloque
12th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2009)Date du colloque
2009-03Ville du colloque
YorkPays du colloque
Royaume-UniTitre de l'ouvrage
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. ProceedingsAuteurs de l’ouvrage
de Alfaro, LucaÉditeur
Springer
Titre de la collection
Lecture Notes in Computer ScienceNuméro dans la collection
5504Ville d’édition
Berlin
Isbn
978-3-642-00595-4
Nombre de pages
471Pages
197-211
Identifiant publication
Métadonnées
Afficher la notice complèteRésumé (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.Mots-clés
hybrid automata; timed automata; multi-task systems; interruptions; decidability of reachabilityPublications associées
Affichage des éléments liés par titre et auteur.
-
Roux, Olivier-Henri; Lime, Didier; Haddad, Serge; Cassez, Franck; Bérard, Béatrice (2005) Communication / Conférence
-
Roux, Olivier-Henri; Bérard, Béatrice; Cassez, Franck; Haddad, Serge; Lime, Didier (2005) Communication / Conférence
-
Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2006) Communication / Conférence
-
Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2006) Communication / Conférence
-
Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2008) Article accepté pour publication ou publié