{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T15:16:48Z","timestamp":1784560608489,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642242878","type":"print"},{"value":"9783642242885","type":"electronic"}],"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-24288-5_19","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T05:46:57Z","timestamp":1316843217000},"page":"218-230","source":"Crossref","is-referenced-by-count":4,"title":["A Fully Symbolic Bisimulation Algorithm"],"prefix":"10.1007","author":[{"given":"Malcolm","family":"Mumme","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gianfranco","family":"Ciardo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Non-Well-Founded Sets","author":"P. Aczel","year":"1988","unstructured":"Aczel, P.: Non-Well-Founded Sets. CSLI, Stanford (1988)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-56496-9_9","volume-title":"Computer Aided Verification","author":"A. Bouali","year":"1993","unstructured":"Bouali, A., Simone, R.D.: Symbolic bisimulation minimisation. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 96\u2013108. Springer, Heidelberg (1993)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11901914_7","volume-title":"Automated Technology for Verification and Analysis","author":"M.Y. Chung","year":"2006","unstructured":"Chung, M.Y., Ciardo, G., Yu, A.J.: A fine-grained fullness-guided chaining heuristic for symbolic reachability analysis. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 51\u201366. Springer, Heidelberg (2006)"},{"key":"19_CR4","unstructured":"Ciardo, G., et al.: SMART: Stochastic Model checking Analyzer for Reliability and Timing, User Manual, \n                  \n                    http:\/\/www.cs.ucr.edu\/~ciardo\/SMART\/"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D., Klawe, M., Rodeh, M.: An O(n logn) unidirectional distributed algorithm for extrema finding in a circle. J. of Algorithms\u00a03(3), 245\u2013260 (1982)","journal-title":"J. of Algorithms"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","volume":"311","author":"A. Dovier","year":"2004","unstructured":"Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theor. Comput. Sci.\u00a0311, 221\u2013256 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/BF01211911","volume":"8","author":"S. Graf","year":"1996","unstructured":"Graf, S., Steffen, B., L\u00fcttgen, G.: Compositional minimisation of finite state systems using interface specifications. Journal of Formal Aspects of Computing\u00a08(5), 607\u2013616 (1996)","journal-title":"Journal of Formal Aspects of Computing"},{"key":"19_CR8","volume-title":"Communication and concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall, Inc., NJ (1989)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal of Computing\u00a016, 973\u2013989 (1987)","journal-title":"SIAM Journal of Computing"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. Paige","year":"1985","unstructured":"Paige, R., Tarjan, R.E., Bonic, R.: A linear time solution to the single function coarsest partition problem. Theoretical Computer Science\u00a040, 67\u201384 (1985)","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"19_CR12","unstructured":"Tilgner, M., Takahashi, Y., Ciardo, G.: SNS 1.0: Synchronized Network Solver. In: 1st Int. Workshop on Manuf. & Petri Nets, Osaka, Japan, pp. 215\u2013234 (June 1996)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-540-95891-8_52","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"M. Wan","year":"2009","unstructured":"Wan, M., Ciardo, G.: Symbolic state-space generation of asynchronous systems using extensible decision diagrams. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 582\u2013594. Springer, Heidelberg (2009)"},{"key":"19_CR14","first-page":"203","volume-title":"Proceedings of the 10th GI\/ITG\/GMM-Workshop \u201cMethoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen\u201d (MBMV)","author":"R. Wimmer","year":"2007","unstructured":"Wimmer, R., Herbstritt, M., Becker, B.: Forwarding, splitting, and block ordering to optimize BDD-based bisimulation computation. In: Haubelt, C., Teich, J. (eds.) Proceedings of the 10th GI\/ITG\/GMM-Workshop \u201cMethoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen\u201d (MBMV), pp. 203\u2013212. Shaker Verlag, Erlangen (2007)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24288-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T20:37:24Z","timestamp":1554669444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24288-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242878","9783642242885"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24288-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}