{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T11:10:09Z","timestamp":1746097809459,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642540127"},{"type":"electronic","value":"9783642540134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54013-4_7","type":"book-chapter","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T01:08:09Z","timestamp":1388711289000},"page":"118-136","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic Automata for Safety LTL Specifications"],"prefix":"10.1007","author":[{"given":"Dileep","family":"Kini","sequence":"first","affiliation":[]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1552285.1552287","volume":"56","author":"R. Chadha","year":"2009","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: On the expressiveness and complexity of randomization in finite state monitors. J. ACM\u00a056(5), 26:1\u201326:44 (2009)","journal-title":"J. ACM"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Baier, C., Gr\u00f6\u03b2er, M.: Recognizing \u03c9-regular languages with probabilistic automata. In: Proceedings of the IEEE Symposium on Logic in Computer Science, pp. 137\u2013146 (2005)","DOI":"10.1109\/LICS.2005.41"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M. Rabin","year":"1963","unstructured":"Rabin, M.: Probabilitic automata. Information and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Information and Control"},{"key":"7_CR4","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press (1971)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-78499-9_21","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Baier","year":"2008","unstructured":"Baier, C., Bertrand, N., Gr\u00f6\u00dfer, M.: On decision problems for probabilistic b\u00fcchi automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 287\u2013301. Springer, Heidelberg (2008)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Sistla, A.P.: Safety, liveness and fairness in temporal logic. Formal Aspect of Computing, 495\u2013511 (1999)","DOI":"10.1007\/BF01211865"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-48683-6_17","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"1999","unstructured":"Kupferman, O., Vardi, M.Y.: Model checking of safety properties. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 172\u2013183. Springer, Heidelberg (1999)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: Temporal verification of reactive and concurrent systems: Specification. Springer (1992)","DOI":"10.1007\/978-1-4612-0931-7"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/963927.963928","volume":"5","author":"R. Alur","year":"2004","unstructured":"Alur, R., La Torre, S.: Deterministic generators and games for ltl fragments. ACM Trans. Comput. Logic\u00a05(1), 1\u201325 (2004)","journal-title":"ACM Trans. Comput. Logic"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Yao, A.: Some complexity questions related to distributed computing. In: Proceedings of the ACM Symposium on Theory of Computation, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Kushilevtiz, E., Nisan, N.: Communication Complexity. Cambridge University Press (1996)","DOI":"10.1017\/CBO9780511574948"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Kremer, I., Nisan, N., Ron, D.: On randomized one-round communication complexity. In: Symposium on Theory of Computing (June 1995)","DOI":"10.1145\/225058.225277"},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, New York (1995)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"M.Y. Vardi","year":"1996","unstructured":"Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, Heidelberg (1996)"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability & Its Applications\u00a016(2), 264\u2013280 (1971)","journal-title":"Theory of Probability & Its Applications"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-20674-0_6","volume-title":"Model Checking and Artificial Intelligence","author":"O. Kupferman","year":"2011","unstructured":"Kupferman, O., Rosenberg, A.: The blow-up in translating LTL to deterministic automata. In: van der Meyden, R., Smaus, J.-G. (eds.) MoChArt 2010. LNCS, vol.\u00a06572, pp. 85\u201394. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54013-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T10:40:05Z","timestamp":1746096005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54013-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642540127","9783642540134"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54013-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}