DI-UMONS : Dépôt institutionnel de l’université de Mons

Recherche transversale
Rechercher
(titres de publication, de périodique et noms de colloque inclus)
2008-06-01 - Article/Dans un journal avec peer-review - Anglais - 10 page(s)

Baier Christel, Bertrand Nathalie, Bouyer Patricia, Brihaye Thomas , Groesser Marcus, "Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata" in IEEE proceedings, 217-226

  • Codes CREF : Informatique mathématique (DI1160)
  • Unités de recherche UMONS : Mathématiques effectives (S820)
Texte intégral :

Abstract(s) :

(Anglais) In this paper, we define two relaxed semantics (one based on probabilities and the other one based on the topological notion of largeness) for LTL over infinite runs of timed automata which rule out unlikely sequences of events. We prove that these two semantics match in the framework of single-clock timed automata (and only in that framework), and prove that the corresponding relaxed model-checking problems are PSPACE-Complete. Moreover, we prove that the probabilistic non-Zenoness can be decided for single-clocktimed automata in NLOGSPACE.

Identifiants :
  • DOI : 10.1109/LICS.2008.25