| dc.contributor.author | Bérard, Béatrice | |
| dc.contributor.author | Haddad, Serge | |
| dc.date.accessioned | 2010-11-16T11:22:17Z | |
| dc.date.available | 2010-11-16T11:22:17Z | |
| dc.date.issued | 2009 | |
| dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/5082 | |
| dc.language.iso | en | en |
| dc.subject | hybrid automata | en |
| dc.subject | timed automata | en |
| dc.subject | multi-task systems | en |
| dc.subject | interruptions | en |
| dc.subject | decidability of reachability | en |
| dc.subject.ddc | 004 | en |
| dc.title | Interrupt Timed Automata | en |
| dc.type | Communication / Conférence | |
| dc.description.abstracten | 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. | en |
| dc.identifier.citationpages | 197-211 | en |
| dc.relation.ispartofseriestitle | Lecture Notes in Computer Science | |
| dc.relation.ispartofseriesnumber | 5504 | |
| dc.relation.ispartoftitle | 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 | en |
| dc.relation.ispartofeditor | de Alfaro, Luca | |
| dc.relation.ispartofpublname | Springer | en |
| dc.relation.ispartofpublcity | Berlin | en |
| dc.relation.ispartofdate | 2009 | |
| dc.relation.ispartofpages | 471 | en |
| dc.relation.ispartofurl | http://dx.doi.org/10.1007/978-3-642-00596-1 | en |
| dc.description.sponsorshipprivate | oui | en |
| dc.subject.ddclabel | Informatique générale | en |
| dc.relation.ispartofisbn | 978-3-642-00595-4 | en |
| dc.relation.conftitle | 12th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2009) | en |
| dc.relation.confdate | 2009-03 | |
| dc.relation.confcity | York | en |
| dc.relation.confcountry | Royaume-Uni | en |
| dc.identifier.doi | http://dx.doi.org/10.1007/978-3-642-00596-1_15 | |
