{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:55Z","timestamp":1761611215926},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434191"},{"type":"electronic","value":"9783540460022"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46002-0_29","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:59Z","timestamp":1193552999000},"page":"415-430","source":"Crossref","is-referenced-by-count":7,"title":["Simulation as Coarsest Partition Problem"],"prefix":"10.1007","author":[{"given":"Raffaella","family":"Gentilini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla","family":"Piazza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"29_CR1","unstructured":"J. van Benthem. Modal Correspondence Theory. PhD thesis, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzoek van Exacte Wetenschappen, 1976."},{"key":"29_CR2","unstructured":"B. Bloom. Ready Simulation, Bisimulation, and the Semantics of CCS-like Languages. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1989."},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0167-6423(95)00003-B","volume":"24","author":"B. Bloom","year":"1995","unstructured":"Bard Bloom and Robert Paige. Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming, 24(3):189\u2013220, 1995.","journal-title":"Science of Computer Programming"},{"key":"29_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/10721959_20","volume-title":"Proc. 17th Int\u2019l Conference on Automated Deduction (CADE\u201900)","author":"D. Bustan","year":"2000","unstructured":"D. Bustan and O. Grumberg. Simulation based minimization. In D.A. McAllester, editor, Proc. 17th Int\u2019l Conference on Automated Deduction (CADE\u201900), volume 1831 of LNCS, pages 255\u2013270. Springer, 2000."},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36\u201372, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"29_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/3-540-55179-4_6","volume-title":"Proceedings of Computer Aided Verification (CAV\u201991), 1992","author":"R. Cleaveland","year":"1992","unstructured":"R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In K.G. Larsen and A. Skou, editors, Proceedings of Computer Aided Verification (CAV\u201991), volume 575 of LNCS, pages 48\u201358. Springer, 1992."},{"key":"29_CR7","series-title":"Lect Notes Comput Sci","first-page":"480","volume-title":"Proc. 7th Int\u2019l Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201901), 2001","author":"R. Cleaveland","year":"2001","unstructured":"R. Cleaveland and L. Tan. Simulation revised. In T. Margaria and W. Yi, editors, Proc. 7th Int\u2019l Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201901), volume 2031 of LNCS, pages 480\u2013495. Springer, 2001."},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/244795.244800","volume":"19","author":"D. Dams","year":"1997","unstructured":"D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253\u2013291, 1997.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"29_CR9","first-page":"244","volume-title":"Rewrite Systems","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems, volume B, chapter 6, pages 244\u2013320. Elsevier\/ MIT press, 1990."},{"key":"29_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-44585-4_8","volume-title":"Proceedings of Computer Aided Verification (CAV\u201901), 2001","author":"A. Dovier","year":"2001","unstructured":"A. Dovier, C. Piazza, and A. Policriti. A fast bisimulation algorithm. In G. Berry, H. Comon, and A. Finkel, editors, Proceedings of Computer Aided Verification (CAV\u201901), volume 2102 of LNCS, pages 79\u201390. Springer, 2001."},{"issue":"10","key":"29_CR11","first-page":"493","volume":"IV","author":"M. Forti","year":"1983","unstructured":"M. Forti and F. Honsell. Set theory with free construction principles. Annali Scuola Normale Superiore di Pisa, Cl. Sc., IV(10):493\u2013522, 1983.","journal-title":"Annali Scuola Normale Superiore di Pisa, Cl. Sc."},{"key":"29_CR12","volume-title":"Simulation as coarsest partition problem","author":"R. Gentilini","year":"2001","unstructured":"R. Gentilini, C. Piazza, and A. Policriti. Simulation as coarsest partition problem. RR 04-01, Dep. of Computer Science, University of Udine, Italy, 2001. Available at http:\/\/www.dimi.uniud.it\/~piazza\/simul.ps.gz ."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"M. R. Henzinger, T. A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In 36th Annual Symposium on Foundations of Computer Science (FOCS\u201995), pages 453\u2013462. IEEE Computer Society Press, 1995.","DOI":"10.1109\/SFCS.1995.492576"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"J.E. Hopcroft. An nlogn algorithm for minimizing states in a finite automaton. In Theory of Machines and Computations, Ed. by Zvi Kohavi and Azaria Paz, pages 189\u2013196. Academic Press, 1971.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"R. Milner. A calculus of communicating systems. In G. Goos and J. Hartmanis, editors, Lecture Notes on Computer Science, volume 92. Springer, 1980.","DOI":"10.1007\/3-540-10235-3"},{"issue":"3","key":"29_CR16","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/177492.177725","volume":"16","author":"O. Grumberg","year":"1994","unstructured":"O. Grumberg and D.E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and systems, 16(3):843\u2013871, 1994.","journal-title":"ACM Transactions on Programming Languages and systems"},{"issue":"6","key":"29_CR17","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"29_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. Paige","year":"1985","unstructured":"R. Paige, R. E. Tarjan, and R. Bonic. A linear time solution to the single function coarsest partition problem. Theoretical Computer Science, 40(1):67\u201384, 1985.","journal-title":"Theoretical Computer Science"}],"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\/3-540-46002-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:28:53Z","timestamp":1556936933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46002-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434191","9783540460022"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-46002-0_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}