{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:04:33Z","timestamp":1725555873850},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121036"},{"type":"electronic","value":"9783642121043"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12104-3_22","type":"book-chapter","created":{"date-parts":[[2010,5,20]],"date-time":"2010-05-20T13:00:35Z","timestamp":1274360435000},"page":"287-301","source":"Crossref","is-referenced-by-count":7,"title":["Correctness Issues of Symbolic Bisimulation Computation for Markov Chains"],"prefix":"10.1007","author":[{"given":"Ralf","family":"Wimmer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1137\/1.9780898719789","volume-title":"Branching Programs and Binary Decision Diagrams \u2013 Theory and Applications","author":"I. Wegener","year":"2000","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams \u2013 Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications, p. 408. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2000)"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1016091902809","volume":"21","author":"K. Fisler","year":"2002","unstructured":"Fisler, K., Vardi, M.Y.: Bisimulation minimization and symbolic model checking. Formal Methods in System Design\u00a021(1), 39\u201378 (2002)","journal-title":"Formal Methods in System Design"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-71209-1_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.P. Katoen","year":"2007","unstructured":"Katoen, J.P., Kemna, T., Zapreev, I., Jansen, D.N.: Bisimulation minimization mostly speeds up probabilistic model checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 87\u2013101. Springer, Heidelberg (2007)"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1109\/TSE.2008.102","volume":"35","author":"E. B\u00f6de","year":"2009","unstructured":"B\u00f6de, E., Herbstritt, M., Hermanns, H., Johr, S., Peikenkamp, T., Pulungan, R., Rakow, J., Wimmer, R., Becker, B.: Compositional dependability evaluation for Statemate. IEEE Transactions on Software Engineering\u00a035(2), 274\u2013292 (2009)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Blom, S., Haverkort, B.R., Kuntz, M., van de Pol, J.: Distributed Markovian bisimulation reduction aimed at CSL model checking. In: \u010cern\u00e1, I., L\u00fcttgen, G. (eds.) 7th Int\u2019l Workshop on Parallel and Distributed Methods in Verification (PDMC). Electronic Notes in Theoretical Computer Science, vol.\u00a0220(2), pp. 35\u201350 (2008)","DOI":"10.1016\/j.entcs.2008.11.012"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-71209-1_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Derisavi","year":"2007","unstructured":"Derisavi, S.: A symbolic algorithm for optimal markov chain lumping. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 139\u2013154. Springer, Heidelberg (2007)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/QEST.2007.27","volume-title":"4th Int\u2019l Conf. on Quantitative Evaluation of Systems (QEST)","author":"S. Derisavi","year":"2007","unstructured":"Derisavi, S.: Signature-based symbolic algorithm for optimal Markov chain lumping. In: 4th Int\u2019l Conf. on Quantitative Evaluation of Systems (QEST), Edinburgh, Scotland, pp. 141\u2013150. IEEE Computer Society Press, Los Alamitos (2007)"},{"issue":"6","key":"22_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0020-0190(03)00343-0","volume":"87","author":"S. Derisavi","year":"2003","unstructured":"Derisavi, S., Hermanns, H., Sanders, W.H.: Optimal state-space lumping in Markov chains. Information Processing Letters\u00a087(6), 309\u2013315 (2003)","journal-title":"Information Processing Letters"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/QEST.2008.14","volume-title":"5th Int\u2019l Conf. on Quantitative Evaluation of Systems (QEST)","author":"R. Wimmer","year":"2008","unstructured":"Wimmer, R., Derisavi, S., Hermanns, H.: Symbolic partition refinement with dynamic balancing of time and space. In: Rubino, G. (ed.) 5th Int\u2019l Conf. on Quantitative Evaluation of Systems (QEST), Saint-Malo, France, pp. 65\u201374. IEEE Computer Society Press, Los Alamitos (2008)"},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s10009-004-0185-2","volume":"7","author":"S. Blom","year":"2005","unstructured":"Blom, S., Orzan, S.: Distributed state space minimization. Software Tools for Technology Transfer (STTT)\u00a07(3), 280\u2013291 (2005)","journal-title":"Software Tools for Technology Transfer (STTT)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/11901914_35","volume-title":"Automated Technology for Verification and Analysis","author":"R. Wimmer","year":"2006","unstructured":"Wimmer, R., Herbstritt, M., Hermanns, H., Strampp, K., Becker, B.: Sigref \u2013 A symbolic bisimulation tool box. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 477\u2013492. Springer, Heidelberg (2006)"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ic.2005.03.001","volume":"200","author":"C. Baier","year":"2005","unstructured":"Baier, C., Katoen, J.P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Information and Computation\u00a0200(2), 149\u2013214 (2005)","journal-title":"Information and Computation"},{"issue":"8","key":"22_CR13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. on Computers"},{"key":"22_CR14","unstructured":"IEEE Computer Society Standards Committee. Working group of the Microprocessor Standards Subcommittee, American National Standards Institute: IEEE Standard for Binary Floating-Point Arithmetic. ANSI\/IEEE Standard 754-1985. IEEE Computer Society Press, Silver Spring, MD 20910, USA (1985)"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D. Goldberg","year":"1991","unstructured":"Goldberg, D.: What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys\u00a023(1), 5\u201348 (1991)","journal-title":"ACM Computing Surveys"},{"key":"22_CR16","unstructured":"Somenzi, F.: Cudd: Cu decision diagram package, release 2.4.2 (2009)"},{"key":"22_CR17","unstructured":"GNU: GNU multiple precision arithmetic library (GMP), version 4.3.1 (2009), \n                    \n                      http:\/\/gmplib.org\n                    \n                    \n                  ."},{"issue":"3","key":"22_CR18","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/0743-7315(92)90006-9","volume":"15","author":"W.H. Sanders","year":"1992","unstructured":"Sanders, W.H., Malhis, L.M.: Dependability evaluation using composed SAN-based reward models. Journal Parallel and Distributed Computing\u00a015(3), 238\u2013254 (1992)","journal-title":"Journal Parallel and Distributed Computing"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/11817963_23","volume-title":"Computer Aided Verification","author":"M. Kwiatkowska","year":"2006","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Symmetry reduction for probabilistic model checking. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 234\u2013248. Springer, Heidelberg (2006)"},{"issue":"9","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1109\/49.62852","volume":"8","author":"O. Ibe","year":"1990","unstructured":"Ibe, O., Trivedi, K.: Stochastic Petri net models of polling systems. IEEE Journal on Selected Areas in Communications\u00a08(9), 1649\u20131657 (1990)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"3","key":"22_CR21","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/s10009-005-0187-8","volume":"8","author":"H. Younes","year":"2006","unstructured":"Younes, H., Kwiatkowska, M., Norman, G., Parker, D.: Numerical vs. statistical probabilistic model checking. Software Tools for Technology Transfer (STTT)\u00a08(3), 216\u2013228 (2006)","journal-title":"Software Tools for Technology Transfer (STTT)"},{"key":"22_CR22","unstructured":"Ciardo, G., Tilgner, M.: On the use of Kronecker operators for the solution of generalized stochastic Petri nets. ICASE Report 96\u201335, Institute for Computer Applications in Science and Engineering, ICASE (1996)"},{"issue":"3","key":"22_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.tcs.2007.11.013","volume":"319","author":"J. Heath","year":"2008","unstructured":"Heath, J., Kwiatkowska, M., Norman, G., Parker, D., Tymchyshyn, O.: Probabilistic model checking of complex biological pathways. Theoretical Computer Science\u00a0319(3), 239\u2013257 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"22_CR24","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.entcs.2004.08.072","volume":"180","author":"P. Lecca","year":"2007","unstructured":"Lecca, P., Priami, C.: Cell cycle control in eukaryotes: A BioSpi model. Electronic Notes in Theoretical Computer Science\u00a0180(3), 51\u201363 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12104-3_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:03:13Z","timestamp":1619784193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12104-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121036","9783642121043"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12104-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}