A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="http://pdfs.semanticscholar.org/08d2/01b0ea3cfc94e70e200ebb260f765707df9d.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
Like most models used in model-checking, timed automata are an idealized mathematical model used for representing systems with strong timing requirements. In such mathematical models, properties can be violated, due to unlikely (sequences of) events. We propose two new semantics for the satisfaction of LTL formulas, one based on probabilities, and the other one based on topology, to rule out these sequences. We prove that the two semantics are equivalent and lead to a PSPACE-Complete<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-77050-3_15">doi:10.1007/978-3-540-77050-3_15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hhvbzkyxzrdd7kibtkb4pdwzey">fatcat:hhvbzkyxzrdd7kibtkb4pdwzey</a> </span>
more »... ing problem for LTL over finite executions. Idealization of mathematical models. Timed automata are an idealized mathematical model, in which several assumptions are implicitely made: it has infinite precision, instantaneous events, etc. Several ideas have been explored to overcome the fact that these hypotheses are in practice unrealistic. The model of implementable controllers has been proposed, where constraints and precision of clocks are somewhat relaxed  . In this framework, if the model satisfies a safety property, then, on a simple model of processor, its implementation will also satisfy this property. This implementation model has been considered in [15, 7, 4, 6] . However, it induces a very strong notion of robustness, suitable for really critical systems (like rockets or X-by-wire systems in cars), but maybe too strong for less critical systems (like mobile phones or network applications). ⋆ Partly supported by a Lavoisier fellowship. ⋆⋆ Partly supported by a Marie Curie fellowship.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190217225330/http://pdfs.semanticscholar.org/08d2/01b0ea3cfc94e70e200ebb260f765707df9d.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/08/d2/08d201b0ea3cfc94e70e200ebb260f765707df9d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-77050-3_15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>