loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 23rd Annual IEEE Symposium on Logic in Computer Science
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata
June 24-June 27
ISBN: 978-0-7695-3183-0
ASCII Text
x 
 
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Gr?Ber, "Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata," Logic in Computer Science, Symposium on, pp. 217-226, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2008.25,
author = {Christel Baier and Nathalie Bertrand and Patricia Bouyer and Thomas Brihaye and Marcus Gr?Ber},
title = {Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2008},
issn = {1043-6871},
pages = {217-226},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2008.25},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata
SN - 1043-6871
SP217
EP226
A1 - Christel Baier,
A1 - Nathalie Bertrand,
A1 - Patricia Bouyer,
A1 - Thomas Brihaye,
A1 - Marcus Gr?Ber,
PY - 2008
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
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.
Citation:
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Gr?Ber, "Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata," lics, pp.217-226, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008
Usage of this product signifies your acceptance of the Terms of Use.