{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:37:45Z","timestamp":1725579465426},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198342"},{"type":"electronic","value":"9783642198359"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19835-9_29","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T15:03:16Z","timestamp":1300114996000},"page":"311-325","source":"Crossref","is-referenced-by-count":8,"title":["Confluence Reduction for Probabilistic Systems"],"prefix":"10.1007","author":[{"given":"Mark","family":"Timmer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Baier, C., D\u2019Argenio, P.R., Gr\u00f6\u00dfer, M.: Partial order reduction for probabilistic branching time. In: Proc. of the 3rd Workshop on Quantitative Aspects of Programming Languages (QAPL). ENTCS, vol.\u00a0153(2), pp. 97\u2013116 (2006)","DOI":"10.1016\/j.entcs.2005.10.034"},{"key":"29_CR2","first-page":"230","volume-title":"Proc. of the 1st International Conference on Quantitative Evaluation of Systems (QEST)","author":"C. Baier","year":"2004","unstructured":"Baier, C., Gr\u00f6\u00dfer, M., Ciesinski, F.: Partial order reduction for probabilistic systems. In: Proc. of the 1st International Conference on Quantitative Evaluation of Systems (QEST), pp. 230\u2013239. IEEE Computer Society, Los Alamitos (2004)"},{"key":"29_CR3","unstructured":"Blom, S.C.C.: Partial \u03c4-confluence for efficient state space generation. Technical Report SEN-R0123, CWI, Amsterdam (2001)"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-45657-0_50","volume-title":"Computer Aided Verification","author":"S.C.C. Blom","year":"2002","unstructured":"Blom, S.C.C., van de Pol, J.C.: State space reduction by proving confluence. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 596\u2013609. Springer, Heidelberg (2002)"},{"key":"29_CR5","first-page":"240","volume-title":"Proc. of the 1st International Conference on Quantitative Evaluation of Systems (QEST)","author":"P.R. D\u2019Argenio","year":"2004","unstructured":"D\u2019Argenio, P.R., Niebert, P.: Partial order reduction on concurrent probabilistic programs. In: Proc. of the 1st International Conference on Quantitative Evaluation of Systems (QEST), pp. 240\u2013249. IEEE Computer Society, Los Alamitos (2004)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Fokkink, W., Pang, J.: Simplifying Itai-Rodeh leader election for anonymous rings. In: Proc. of the 4th International Workshop on Automated Verification of Critical Systems (AVoCS). ENTCS, vol.\u00a0128(6), pp. 53\u201368 (2005)","DOI":"10.1016\/j.entcs.2005.04.004"},{"key":"29_CR7","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., Ferrer Fioriti, L.M.: 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)"},{"issue":"1-2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(96)80702-X","volume":"170","author":"J.F. Groote","year":"1996","unstructured":"Groote, J.F., Sellink, M.P.A.: Confluence for process verification. Theoretical Computer Science\u00a0170(1-2), 47\u201381 (1996)","journal-title":"Theoretical Computer Science"},{"key":"29_CR9","unstructured":"Gr\u00f6\u00dfer, M.: Reduction Methods for Probabilistic Model Checking. PhD thesis, Technische Universit\u00e4t Dresden (2008)"},{"key":"29_CR10","first-page":"213","volume-title":"Proc. of the 10th International Conference on Application of Concurrency to System Design (ACSD)","author":"J.-P. Katoen","year":"2010","unstructured":"Katoen, J.-P., van de Pol, J.C., Stoelinga, M.I.A., Timmer, M.: A linear process-algebraic format for probabilistic systems with data. In: Proc. of the 10th International Conference on Application of Concurrency to System Design (ACSD), pp. 213\u2013222. IEEE Computer Society, Los Alamitos (2010)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-53479-2_17","volume-title":"Semantics of Systems of Concurrent Processes","author":"R. Nicola De","year":"1990","unstructured":"De Nicola, R., Vaandrager, F.W.: Action versus state based logics for transition systems. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol.\u00a0469, pp. 407\u2013419. Springer, Heidelberg (1990)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-45069-6_41","volume-title":"Computer Aided Verification","author":"G.J. Pace","year":"2003","unstructured":"Pace, G.J., Lang, F., Mateescu, R.: Calculating \u03c4-confluence compositionally. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 446\u2013459. Springer, Heidelberg (2003)"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"29_CR14","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology (1995)"},{"issue":"2","key":"29_CR15","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computation\u00a02(2), 250\u2013273 (1995)","journal-title":"Nordic Journal of Computation"},{"key":"29_CR16","unstructured":"Stoelinga, M.I.A.: Alea jacta est: verification of probabilistic, real-time and parametric systems. PhD thesis, University of Nijmegen (2002)"},{"key":"29_CR17","unstructured":"Timmer, M., Stoelinga, M.I.A., van de Pol, J.C.: Confluence reduction for probabilistic systems (extended version). Technical Report 1011.2314, ArXiv e-prints (2010)"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-04761-9_5","volume-title":"Automated Technology for Verification and Analysis","author":"J.C. Pol van de","year":"2009","unstructured":"van de Pol, J.C., Timmer, M.: State space reduction of linear processes using control flow reconstruction. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol.\u00a05799, pp. 54\u201368. Springer, Heidelberg (2009)"},{"issue":"3","key":"29_CR19","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM\u00a043(3), 555\u2013600 (1996)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19835-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:26:37Z","timestamp":1558437997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19835-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198342","9783642198359"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19835-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}