{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:57Z","timestamp":1740099057622,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319773124"},{"type":"electronic","value":"9783319773131"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77313-1_21","type":"book-chapter","created":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T02:20:49Z","timestamp":1520389249000},"page":"271-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Timed Comparisons of Semi-Markov Processes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7470-4962","authenticated-orcid":false,"given":"Mathias R.","family":"Pedersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathana\u00ebl","family":"Fijalkow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4004-6049","authenticated-orcid":false,"given":"Giorgio","family":"Bacci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Mardare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,8]]},"reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.ipl.2014.08.013","volume":"115","author":"S Akshay","year":"2015","unstructured":"Akshay, S., Antonopoulos, T., Ouaknine, J., Worrell, J.: Reachability problems for Markov chains. Inf. Process. Lett. 115(2), 155\u2013158 (2015)","journal-title":"Inf. Process. Lett."},{"key":"21_CR2","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"issue":"2","key":"21_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.ic.2005.03.001","volume":"200","author":"C Baier","year":"2005","unstructured":"Baier, C., Katoen, J.P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Inf. Comput. 200(2), 149\u2013214 (2005)","journal-title":"Inf. Comput."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: STOC, ACM, pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Condon, A., Lipton, R.J.: On the complexity of space bounded interactive proofs (extended abstract). In: FOCS (1989)","DOI":"10.1109\/SFCS.1989.63519"},{"issue":"4","key":"21_CR6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/3157831.3157833","volume":"4","author":"N Fijalkow","year":"2017","unstructured":"Fijalkow, N.: Undecidability results for probabilistic automata. SIGLOG News 4(4), 10\u201317 (2017)","journal-title":"SIGLOG News"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Fijalkow, N., Riveros, C., Worrell, J.: Probabilistic automata of bounded ambiguity. In: CONCUR, pp. 19:1\u201319:14 (2017)","DOI":"10.1016\/j.tcs.2017.04.006"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-14162-1_44","volume-title":"Automata, Languages and Programming","author":"H Gimbert","year":"2010","unstructured":"Gimbert, H., Oualhadj, Y.: Probabilistic automata on finite words: decidable and undecidable problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 527\u2013538. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_44"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-31424-7_33","volume-title":"Computer Aided Verification","author":"S Guha","year":"2012","unstructured":"Guha, S., Narayan, C., Arun-Kumar, S.: On decidability of prebisimulation for timed automata. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 444\u2013461. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_33"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44685-0_18","volume-title":"CONCUR 2001 \u2014 Concurrency Theory","author":"G L\u00fcttgen","year":"2001","unstructured":"L\u00fcttgen, G., Vogler, W.: A faster-than relation for asynchronous processes. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 262\u2013276. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_18"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/3-540-54430-5_104","volume-title":"CONCUR \u201991","author":"F Moller","year":"1991","unstructured":"Moller, F., Tofts, C.: Relating processes with respect to speed. In: Baeten, J.C.M., Groote, J.F. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 424\u2013438. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54430-5_104"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: Positivity problems for low-order linear recurrence sequences. In: SODA (2014)","DOI":"10.1137\/1.9781611973402.27"},{"key":"21_CR13","volume-title":"Introduction to Probabilistic Automata","author":"A Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)"},{"key":"21_CR14","unstructured":"Pedersen, M.R., Fijalkow, N., Bacci, G., Larsen K.G., Mardare, R.: Timed comparisons of semi-Markov processes. CoRR (2017). http:\/\/arxiv.org\/abs\/1711.10216"},{"issue":"4","key":"21_CR15","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1109\/24.693787","volume":"46","author":"M Perman","year":"1997","unstructured":"Perman, M., Senegacnik, A., Tuma, M.: Semi-Markov models with an application to power-plant reliability analysis. IEEE Trans. Reliab. 46(4), 526\u2013532 (1997)","journal-title":"IEEE Trans. Reliab."},{"issue":"3","key":"21_CR16","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1109\/TPWRS.2004.826756","volume":"19","author":"A Pievatolo","year":"2004","unstructured":"Pievatolo, A., Tironi, E., Valade, I.: Semi-Markov processes for power system reliability assessment with application to uninterruptible power supply. IEEE Trans. Power Syst. 19(3), 1326\u20131333 (2004)","journal-title":"IEEE Trans. Power Syst."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A decision method for elementary algebra and geometry. University of California Press, Berkeley (1951)","DOI":"10.1525\/9780520348097"},{"issue":"1","key":"21_CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"RJ Glabbeek van","year":"1995","unstructured":"van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Inf. Comput. 121(1), 59\u201380 (1995)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77313-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T12:52:26Z","timestamp":1660567946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-77313-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319773124","9783319773131"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77313-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}