Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.

Abstract

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-clock timed automata in NLOGSPACE.

Dates and versions

inria-00424520 , version 1 (16-10-2009)

Identifiers

Cite

Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Grösser. Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.. 23rd Annual IEEE Symposium on Logic in Computer Science (LICS'08), Jun 2008, Pittsburgh, United States. pp.217-226, ⟨10.1109/LICS.2008.25⟩. ⟨inria-00424520⟩
68 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More