{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:25:42Z","timestamp":1776889542313,"version":"3.51.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T00:00:00Z","timestamp":1418083200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>A stochastic timed automaton is a purely stochastic process defined on a\ntimed automaton, in which both delays and discrete choices are made randomly.\nWe study the almost-sure model-checking problem for this model, that is, given\na stochastic timed automaton A and a property $\\Phi$, we want to decide whether\nA satisfies $\\Phi$ with probability 1. In this paper, we identify several\nclasses of automata and of properties for which this can be decided. The proof\nrelies on the construction of a finite abstraction, called the thick graph,\nthat we interpret as a finite Markov chain, and for which we can decide the\nalmost-sure model-checking problem. Correctness of the abstraction holds when\nautomata are almost-surely fair, which we show, is the case for two large\nclasses of systems, single- clock automata and so-called weak-reactive\nautomata. Techniques employed in this article gather tools from real-time\nverification and probabilistic verification, as well as topological games\nplayed on timed automata.<\/jats:p>","DOI":"10.2168\/lmcs-10(4:6)2014","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T07:32:47Z","timestamp":1431934367000},"source":"Crossref","is-referenced-by-count":37,"title":["Stochastic Timed Automata"],"prefix":"10.46298","volume":"Volume 10, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9957-5394","authenticated-orcid":false,"given":"Nathalie","family":"Bertrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patricia","family":"Bouyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Brihaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quentin","family":"Menet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christel","family":"Baier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Groesser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Jurdzinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2014,12,9]]},"reference":[{"key":"871:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1092\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1092\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:03:15Z","timestamp":1681243395000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,9]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(4:6)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1410.2128","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1410.2128","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,9]]},"article-number":"1092"}}