{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:54:11Z","timestamp":1773104051304,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642040801","type":"print"},{"value":"9783642040818","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04081-8_23","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T12:27:08Z","timestamp":1251721628000},"page":"338-353","source":"Crossref","is-referenced-by-count":17,"title":["Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Giro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro R.","family":"D\u2019Argenio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis Mar\u00eda","family":"Ferrer Fioriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1008767206905","volume":"18","author":"R. Alur","year":"2001","unstructured":"Alur, R., Brayton, R.A., Henzinger, T.A., Qadeer, S., Rajamani, S.K.: Partial-order reduction in symbolic state-space exploration. Formal Methods in System Design\u00a018(2), 97\u2013116 (2001)","journal-title":"Formal Methods in System Design"},{"key":"23_CR2","first-page":"230","volume-title":"QEST 2004","author":"C. Baier","year":"2004","unstructured":"Baier, C., Gr\u00f6\u00dfer, M., Ciesinski, F.: Partial order reduction for probabilistic systems. In: QEST 2004, Washington, DC, USA, pp. 230\u2013239. IEEE CS, Los Alamitos (2004)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Bianco","year":"1995","unstructured":"Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 288\u2013299. Springer, Heidelberg (1995)"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology\u00a01(1), 65\u201375 (1988)","journal-title":"J. Cryptology"},{"key":"23_CR5","unstructured":"Cheung, L.: Reconciling Nondeterministic and Probabilistic Choices. PhD thesis, Radboud Universiteit Nijmegen (2006)"},{"issue":"1-2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2006.07.033","volume":"365","author":"L. Cheung","year":"2006","unstructured":"Cheung, L., Lynch, N., Segala, R., Vaandrager, F.: Switched PIOA: Parallel composition via distributed scheduling. Theor. Comput. Sci.\u00a0365(1-2), 83\u2013108 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR7","first-page":"131","volume-title":"QEST 2006","author":"F. Ciesinski","year":"2006","unstructured":"Ciesinski, F., Baier, C.: LiQuor: A tool for qualitative and quantitative linear time analysis of reactive systems. In: QEST 2006, pp. 131\u2013132. IEEE CS, Los Alamitos (2006)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Ciesinski, F., Baier, C., Gr\u00f6\u00dfer, M., Klein, J.: Reduction techniques for model checking markov decision processes. In: QEST 2008, pp. 45\u201354 (2008)","DOI":"10.1109\/QEST.2008.45"},{"key":"23_CR9","volume-title":"Model Checking","author":"E. Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"23_CR10","first-page":"240","volume-title":"QEST 2004","author":"P. D\u2019Argenio","year":"2004","unstructured":"D\u2019Argenio, P., Niebert, P.: Partial order reduction on concurrent probabilistic programs. In: QEST 2004, Washington, DC, USA, pp. 240\u2013249. IEEE CS, Los Alamitos (2004)"},{"key":"23_CR11","unstructured":"de Alfaro, L.: The verification of probabilistic systems under memoryless partial-information policies is hard. In: PROBMIV 1999. TR CSR-99-8, University of Birmingham, pp. 19\u201332 (1999)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-44685-0_24","volume-title":"CONCUR 2001 - Concurrency Theory","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A., Jhala, R.: Compositional methods for probabilistic systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 351\u2013365. Springer, Heidelberg (2001)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-75454-1_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"S. Giro","year":"2007","unstructured":"Giro, S., D\u2019Argenio, P.: Quantitative model checking revisited: neither decidable nor approximable. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol.\u00a04763, pp. 179\u2013194. Springer, Heidelberg (2007)"},{"key":"23_CR14","unstructured":"Giro, S., D\u2019Argenio, P.: On the expressive power of schedulers in distributed probabilistic systems. In: Proc. of QAPL 2009, York, UK, March 28-29 (2009), Extended version, cs.famaf.unc.edu.ar\/~sgiro\/QAPL09-ext.pdf"},{"key":"23_CR15","first-page":"582","volume-title":"Proc. of 24th SAC","author":"S. Giro","year":"2009","unstructured":"Giro, S., D\u2019Argenio, P.: On the verification of probabilistic I\/O automata with unspecified rates. In: Proc. of 24th SAC, pp. 582\u2013586. ACM Press, New York (2009)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Giro, S., D\u2019Argenio, P.: Partial order reduction for probabilistic systems assuming distributed schedulers. Technical Report Serie A, Inf. 2009\/02, FaMAF, UNC (2009), http:\/\/cs.famaf.unc.edu.ar\/~sgiro\/TR-A-INF-09-2.pdf","DOI":"10.1007\/978-3-642-04081-8_23"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R.v. Glabbeek","year":"1995","unstructured":"Glabbeek, R.v., Smolka, S., Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. Information and Computation\u00a0121, 59\u201380 (1995)","journal-title":"Information and Computation"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","author":"P. Godefroid","year":"1996","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol.\u00a01032. Springer, Heidelberg (1996)"},{"key":"23_CR19","unstructured":"Jeannet, B., D\u2019Argenio, P., Larsen, K.: Rapture: A tool for verifying Markov Decision Processes. In: Cerna, I. (ed.) Tools Day 2002, Brno, Czech Republic, Technical Report, Faculty of Informatics, Masaryk University Brno (2002)"},{"issue":"2","key":"23_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s10009-004-0140-2","volume":"6","author":"M. Kwiatkowska","year":"2004","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: A hybrid approach. International Journal on Software Tools for Technology Transfer (STTT)\u00a06(2), 128\u2013142 (2004)","journal-title":"International Journal on Software Tools for Technology Transfer (STTT)"},{"key":"23_CR21","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Laboratory for Computer Science, MIT (1995)"},{"key":"23_CR22","first-page":"327","volume-title":"Procs. of 26th FOCS","author":"M. Vardi","year":"1985","unstructured":"Vardi, M.: Automatic verification of probabilistic concurrent finite state programs. In: Procs. of 26th FOCS, pp. 327\u2013338. IEEE Press, Los Alamitos (1985)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T04:47:15Z","timestamp":1558500435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}