Skip to Main content Skip to Navigation
New interface
Conference papers

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Nathalie Bertrand Connect in order to contact the contributor
Submitted on : Friday, October 16, 2009 - 11:07:51 AM
Last modification on : Friday, February 4, 2022 - 3:16:58 AM

Links full text



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⟩



Record views