{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,30]],"date-time":"2026-08-30T01:07:26Z","timestamp":1788052046357,"version":"build-2784847793"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T00:00:00Z","timestamp":1410307200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Netherlands Organisation for Scientific Research","doi-asserted-by":"crossref","award":["8575"],"award-info":[{"award-number":["8575"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003246","name":"Netherlands Organisation for Scientific Research","doi-asserted-by":"crossref","award":["2300154663"],"award-info":[{"award-number":["2300154663"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Markov automata (MAs) extend labelled transition systems with random delays\nand probabilistic branching. Action-labelled transitions are instantaneous and\nyield a distribution over states, whereas timed transitions impose a random\ndelay governed by an exponential distribution. MAs are thus a nondeterministic\nvariation of continuous-time Markov chains. MAs are compositional and are used\nto provide a semantics for engineering frameworks such as (dynamic) fault\ntrees, (generalised) stochastic Petri nets, and the Architecture Analysis &amp;\nDesign Language (AADL). This paper considers the quantitative analysis of MAs.\nWe consider three objectives: expected time, long-run average, and timed\n(interval) reachability. Expected time objectives focus on determining the\nminimal (or maximal) expected time to reach a set of states. Long-run\nobjectives determine the fraction of time to be in a set of states when\nconsidering an infinite time horizon. Timed reachability objectives are about\ncomputing the probability to reach a set of states within a given time\ninterval. This paper presents the foundations and details of the algorithms and\ntheir correctness proofs. We report on several case studies conducted using a\nprototypical tool implementation of the algorithms, driven by the MAPA\nmodelling language for efficiently generating MAs.<\/jats:p>","DOI":"10.2168\/lmcs-10(3:17)2014","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T09:40:57Z","timestamp":1415958057000},"source":"Crossref","is-referenced-by-count":25,"title":["Analysis of Timed and Long-Run Objectives for Markov Automata"],"prefix":"10.46298","volume":"Volume 10, Issue 3","author":[{"given":"Dennis","family":"Guck","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hassan","family":"Hatefi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Holger","family":"Hermanns","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6143-1926","authenticated-orcid":false,"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Timmer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2014,9,10]]},"reference":[{"key":"958:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/943\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/943\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:59:40Z","timestamp":1681243180000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,10]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(3:17)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1407.7356","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1407.7356","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/978-3-319-68270-9_19","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,10]]},"article-number":"943"}}