{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:49:41Z","timestamp":1725814181199},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460801"},{"type":"electronic","value":"9783662460818"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46081-8_7","type":"book-chapter","created":{"date-parts":[[2014,12,11]],"date-time":"2014-12-11T09:25:44Z","timestamp":1418289944000},"page":"117-134","source":"Crossref","is-referenced-by-count":3,"title":["Distributed Markov Chains"],"prefix":"10.1007","author":[{"given":"Ratul","family":"Saha","sequence":"first","affiliation":[]},{"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[]},{"given":"Sumit Kumar","family":"Jha","sequence":"additional","affiliation":[]},{"given":"Madhavan","family":"Mukund","sequence":"additional","affiliation":[]},{"given":"P. S.","family":"Thiagarajan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00165-010-0161-4","volume":"23","author":"W.M.P. Aalst van der","year":"2011","unstructured":"van der Aalst, W.M.P., van Hee, K.M., ter Hofstede, A.H.M., Sidorova, N., Verbeek, H.M.W., Voorhoeve, M., Wynn, M.T.: Soundness of workflow nets: Classification, decidability, and analysis. Form. Asp. Comp.\u00a023(3), 333\u2013363 (2011)","journal-title":"Form. Asp. Comp."},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ic.2005.10.001","volume":"204","author":"S. Abbes","year":"2006","unstructured":"Abbes, S., Benveniste, A.: True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures. Info. and Comp.\u00a0204(2), 231\u2013274 (2006)","journal-title":"Info. and Comp."},{"issue":"2-3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2007.09.018","volume":"390","author":"S. Abbes","year":"2008","unstructured":"Abbes, S., Benveniste, A.: True-concurrency probabilistic models: Markov nets and a law of large numbers. Theor. Comput. Sci.\u00a0390(2-3), 129\u2013170 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR4","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. The MIT Press (2008)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bogdoll, J., Ferrer Fioriti, L.M., Hartmanns, A., Hermanns, H.: Partial order Methods for statistical model checking and simulation. In: Bruni, R., Dingel, J. (eds.) FMOODS\/FORTE 2011. LNCS, vol.\u00a06722, pp. 59\u201374. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-21461-5_4"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-40196-1_12","volume-title":"Quantitative Evaluation of Systems","author":"B. Boyer","year":"2013","unstructured":"Boyer, B., Corre, K., Legay, A., Sedwards, S.: PLASMA-lab: A Flexible, sistributable statistical model checking library. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST 2013. LNCS, vol.\u00a08054, pp. 160\u2013164. Springer, Heidelberg (2013)"},{"key":"7_CR7","unstructured":"PRISM: Case studies, \n                  \n                    http:\/\/www.prismmodelchecker.org\/casestudies\/"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Diekert, V., Rozenberg, G.: The book of traces. World Scientific (1995)","DOI":"10.1142\/9789814261456"},{"key":"7_CR9","unstructured":"Esparza, J., Heljanko, K.: Unfoldings: A Partial-Order Approach to Model Checking, 1st edn. Springer Publishing Company (2008)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Esparza, J., Desel, J.: On negotiation as concurrency primitive II: Deterministic cyclic negotiations. In: Muscholl, A. (ed.) FOSSACS 2014. LNCS, vol.\u00a08412, pp. 258\u2013273. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-54830-7_17"},{"key":"7_CR11","unstructured":"Fokkink, W.: Variations on Itai-Rodeh leader election for anonymous rings and their analysis in PRISM. J. UCS, 12 (2006)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/11804192_19","volume-title":"Formal Methods for Components and Objects","author":"M. Groesser","year":"2006","unstructured":"Groesser, M., Baier, C.: Partial order reduction for Markov decision processes: A survey. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol.\u00a04111, pp. 408\u2013427. Springer, Heidelberg (2006)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0890-5401(90)90004-2","volume":"88","author":"A. Itai","year":"1990","unstructured":"Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Info. and Comp.\u00a088(1), 60\u201387 (1990)","journal-title":"Info. and Comp."},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01201811","volume":"29","author":"S. Jesi","year":"1996","unstructured":"Jesi, S., Pighizzini, G., Sabadini, N.: Probabilistic asynchronous automata. Math. Systems Theory\u00a029(1), 5\u201331 (1996)","journal-title":"Math. Systems Theory"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-03845-7_15","volume-title":"Computational Methods in Systems Biology","author":"S.K. Jha","year":"2009","unstructured":"Jha, S.K., Clarke, E.M., Langmead, C.J., Legay, A., Platzer, A., Zuliani, P.: A Bayesian approach to model checking biological systems. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol.\u00a05688, pp. 218\u2013234. Springer, Heidelberg (2009)"},{"key":"7_CR16","volume-title":"Model Checking","author":"E.M. Clarke Jr.","year":"1999","unstructured":"Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"K.L. McMillan","year":"1995","unstructured":"McMillan, K.L., Probst, D.K.: A technique of state space search based on unfolding. Form. Method. Syst. Des.\u00a06(1), 45\u201365 (1995)","journal-title":"Form. Method. Syst. Des."},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01843570","volume":"1","author":"A. Pnueli","year":"1986","unstructured":"Pnueli, A., Zuck, L.D.: Verification of multiprocess probabilistic protocols. Distributed Computing\u00a01(1), 53\u201372 (1986)","journal-title":"Distributed Computing"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Saha, R., Esparza, J., Jha, S.K., Mukund, M., Thiagarajan, P.S.: Distributed Markov chains. Technical report (2014), \n                  \n                    http:\/\/www.comp.nus.edu.sg\/~ratul\/public\/dmc_vmcai.pdf","DOI":"10.1007\/978-3-662-46081-8_7"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-28644-8_31","volume-title":"CONCUR 2004 - Concurrency Theory","author":"D. Varacca","year":"2004","unstructured":"Varacca, D., V\u00f6lzer, H., Winskel, G.: Probabilistic event structures and domains. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 481\u2013496. Springer, Heidelberg (2004)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Wald, A.: Sequential tests of statistical hypotheses. Ann. Math. Statist., 117\u2013186","DOI":"10.1214\/aoms\/1177731118"},{"key":"7_CR22","unstructured":"Lorens, H., Younes, S.: Verification and Planning for Stochastic Processes with Asynchronous Events. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA (2004)"},{"issue":"2","key":"7_CR23","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. ITA\u00a021(2), 99\u2013135 (1987)","journal-title":"ITA"}],"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-662-46081-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:37:59Z","timestamp":1559090279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46081-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460801","9783662460818"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46081-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}