{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:43:04Z","timestamp":1725745384110},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406621"},{"type":"electronic","value":"9783642406638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40663-8_2","type":"book-chapter","created":{"date-parts":[[2013,8,20]],"date-time":"2013-08-20T01:03:57Z","timestamp":1376960637000},"page":"4-5","source":"Crossref","is-referenced-by-count":0,"title":["Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Baier, C., Gr\u00f6\u00dfer, M., Bertrand, N.: Probabilistic -automata. Journal of the ACM\u00a059(1) (2012)","DOI":"10.1145\/2108242.2108243"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Baier, C., Gr\u00f6\u00dfer, M., Ciesinski, F.: Partial order reduction for probabilistic systems. In: 1st International Conference on Quantitative Evaluation of Systems (QEST), pp. 230\u2013239. IEEE Computer Society (2004)","DOI":"10.1109\/QEST.2004.1348037"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Baier, C., Gr\u00f6\u00dfer, M., Ciesinski, F.: Model checking linear-time properties of probabilistic systems. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Monographs in Theoretical Computer Science, pp. 519\u2013570. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_13"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C. Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"Journal of the ACM"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-04081-8_23","volume-title":"CONCUR 2009 - Concurrency Theory","author":"S. Giro","year":"2009","unstructured":"Giro, S., D\u2019Argenio, P.R., Fioriti, L.M.F.: Partial order reduction for probabilistic systems: A revision for distributed schedulers. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 338\u2013353. Springer, Heidelberg (2009)"},{"key":"2_CR6","unstructured":"Gr\u00f6\u00dfer, M.: Reduction Methods for Probabilistic Model Checking. Dissertation, Technische Universit\u00e4t Dresden (2008)"},{"key":"2_CR7","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: 1st IEEE Symposium on Logic in Computer Science (LICS), pp. 332\u2013345. IEEE Computer Society Press (1986)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40663-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T18:29:05Z","timestamp":1558031345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40663-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406621","9783642406638"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40663-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}