• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Aide
  • Connexion
  • Langue 
    • Français
    • English
Consulter le document 
  •   Accueil
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • Consulter le document
  •   Accueil
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • Consulter le document
JavaScript is disabled for your browser. Some features of this site may not work without it.

Afficher

Toute la baseCentres de recherche & CollectionsAnnée de publicationAuteurTitreTypeCette collectionAnnée de publicationAuteurTitreType

Mon compte

Connexion

Enregistrement

Statistiques

Documents les plus consultésStatistiques par paysAuteurs les plus consultés
Thumbnail

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
fossacs2009.pdf (189.8Kb)
Type
Communication / Conférence
Date
2009
Titre du colloque
12th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2009)
Date du colloque
2009-03
Ville du colloque
York
Pays du colloque
Royaume-Uni
Titre 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. Proceedings
Auteurs de l’ouvrage
de Alfaro, Luca
Éditeur
Springer
Titre de la collection
Lecture Notes in Computer Science
Numéro dans la collection
5504
Ville d’édition
Berlin
Isbn
978-3-642-00595-4
Nombre de pages
471
Pages
197-211
Identifiant publication
http://dx.doi.org/10.1007/978-3-642-00596-1_15
Métadonnées
Afficher la notice complète
Auteur(s)
Bérard, Béatrice
Haddad, Serge
Ré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 reachability

Publications associées

Affichage des éléments liés par titre et auteur.

  • Vignette de prévisualisation
    When are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? 
    Roux, Olivier-Henri; Lime, Didier; Haddad, Serge; Cassez, Franck; Bérard, Béatrice (2005) Communication / Conférence
  • Vignette de prévisualisation
    Comparison of the Expressiveness of Timed Automata and Time Petri Nets 
    Roux, Olivier-Henri; Bérard, Béatrice; Cassez, Franck; Haddad, Serge; Lime, Didier (2005) Communication / Conférence
  • Vignette de prévisualisation
    Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences 
    Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2006) Communication / Conférence
  • Vignette de prévisualisation
    Timed Unfoldings for Networks of Timed Automata 
    Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2006) Communication / Conférence
  • Vignette de prévisualisation
    Timed Petri nets and timed automata: On the discriminating power of zeno sequences 
    Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2008) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Tél. : 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo