{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:50Z","timestamp":1725544910942},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423454"},{"type":"electronic","value":"9783540445852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44585-4_27","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T19:39:50Z","timestamp":1265917190000},"page":"286-297","source":"Crossref","is-referenced-by-count":26,"title":["Iterating Transducers"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Dams","sequence":"first","affiliation":[]},{"given":"Yassine","family":"Lakhnech","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Steffen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"27_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BFb0028754","volume-title":"On-the-fly analysis of systems with unbounded lossy Fifo-channels","author":"P. A. Abdulla","year":"1998","unstructured":"P. A. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly analysis of systems with unbounded lossy Fifo-channels. In Hu and Vardi [12], pages 305\u2013318."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"27_CR3","series-title":"Lect Notes Comput Sci","first-page":"135","volume-title":"Regular model checking","author":"A. Bouajjani","year":"2000","unstructured":"A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In Emerson and Sistla [7], pages 135\u2013145."},{"key":"27_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Computer Aided Verification 1990","year":"1991","unstructured":"E. M. Clarke and R. P. Kurshan, editors. Computer Aided Verification 1990, volume 531 of Lecture Notes in Computer Science. Springer-Verlag, 1991."},{"key":"27_CR5","unstructured":"D. Dams, Y. Lakhnech, and M. Steffen. Iterating transducers. Technical Report TR-ST-01-03, Lehrstuhl f\u00fcr Software-Technologie, Institut f\u00fcr Informatik und praktische Mathematik, Christian-Albrechts-Universit\u00e4t Kiel, Jan. 2001. A preliminary version is available on-line at http:\/\/radon.ics.ele.tue.nl\/~vires\/public\/results.htm (reports section)."},{"key":"27_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Theoretical Computer Science","year":"1981","unstructured":"P. Deussen, editor. Fifth GI Conference on Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science. Springer-Verlag, 1981."},{"key":"27_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Computer Aided Verification","year":"2000","unstructured":"E. A. Emerson and A. P. Sistla, editors. CAV\u2019 00, Proceedings of the 12th International Conference on Computer-Aided Verification, Chicago IL, volume 1855 of Lecture Notes in Computer Science. Springer-Verlag, 2000."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6423(90)90071-K","volume":"13","author":"J. Fernandez","year":"1989","unstructured":"J. Fernandez. An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming, 13:219\u2013236, 1989.","journal-title":"Science of Computer Programming"},{"key":"27_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems: 6th International Conference, TACAS 2000, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March\/April 2000. Proceedings","year":"2000","unstructured":"S. Graf and M. Schwartzbach, editors. Proceedings of the Sixth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2000), volume 1785 of Lecture Notes in Computer Science. Springer-Verlag, 2000."},{"key":"27_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Compositional minimization of finite state systems","author":"S. Graf","year":"1991","unstructured":"S. Graf and B. Steffen. Compositional minimization of finite state systems. In Clarke and Kurshan [4]."},{"key":"27_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-63166-6","volume-title":"Computer Aided Verification","author":"O. Grumberg","year":"1997","unstructured":"O. Grumberg, editor. CAV\u2019 97, Proceedings of the 9th International Conference on Computer-Aided Verification, Haifa. Israel, volume 1254 of Lecture Notes in Computer Science. Springer, June 1997."},{"key":"27_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Computer Aided Verification","year":"1998","unstructured":"A. J. Hu and M. Y. Vardi, editors. Computer-Aided Verification, CAV\u2019 98, 10th International Conference, Vancouver, BC, Canada, Proceedings, volume 1427 of Lecture Notes in Computer Science. Springer-Verlag, 1998."},{"key":"27_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Transitive closures for regular relations for verifying infinite-state systems","author":"B. Jonsson","year":"2000","unstructured":"B. Jonsson and M. Nilsson. Transitive closures for regular relations for verifying infinite-state systems. In Graf and Schwartzbach [9]."},{"key":"27_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Symbolic model checking with rich assertional languages","author":"Y. Kesten","year":"1997","unstructured":"Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In Grumberg [11]."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"D. E. Knuth and P. B. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263\u2013297. Pergamon Press, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"27_CR16","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"issue":"6","key":"27_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"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44585-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T22:29:12Z","timestamp":1558823352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44585-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423454","9783540445852"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44585-4_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}