{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:54Z","timestamp":1761611214540},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418658"},{"type":"electronic","value":"9783540453192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45319-9_33","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:50:47Z","timestamp":1184601047000},"page":"480-495","source":"Crossref","is-referenced-by-count":17,"title":["Simulation Revisited"],"prefix":"10.1007","author":[{"given":"Li","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rance","family":"Cleaveland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"33_CR1","unstructured":"A. Aho, J. Hopcroft, and J. Ullman. Design and Analysis of Algorithms. Addisom Wesley, 1974."},{"key":"33_CR2","series-title":"Lect Notes Comput Sci","first-page":"260","volume-title":"Computer Aided Verification (CAV\u2019 92)","author":"S. Bensalem","year":"1992","unstructured":"S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In G.v. Bochmann and D.K. Probst, editors, Computer Aided Verification (CAV\u2019 92), volume 663 of Lecture Notes in Computer Science, pages 260\u2013273, Montr\u00e9al, June\/July 1992. Springer-Verlag."},{"issue":"3","key":"33_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0167-6423(92)90018-7","volume":"18","author":"A. Bouajjani","year":"1992","unstructured":"A. Bouajjani, J.C. Fernandez, N. Halbwachs, C. Ratel, and P. Raymond. Minimal state graph generation. Science of Computer Programming, 18(3):247\u2013271, June 1992.","journal-title":"Science of Computer Programming"},{"issue":"3","key":"33_CR4","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. D. Brookes","year":"1984","unstructured":"S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560\u2013599, July 1984.","journal-title":"Journal of the ACM"},{"key":"33_CR5","unstructured":"B. Bloom. Ready Simulaton, Bisimulation, and the Semantics of CCS-Like languages. PhD thesis, Massachusetts Institute of Technology, Aug. 1989."},{"issue":"3","key":"33_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0167-6423(95)00003-B","volume":"24","author":"B. Bloom","year":"1995","unstructured":"B. Bloom and R. Paige. Transformational design and implementation of a new effcient solution to the ready simulation problem. Science of Computer Programming, 24(3):189\u2013220, June 1995.","journal-title":"Science of Computer Programming"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s004460050010","volume":"9","author":"U. Celikkan","year":"1995","unstructured":"U. Celikkan and R. Cleaveland. Generating diagnostic information for behavioral preordering. Distributed Computing, 9:61\u201375, 1995.","journal-title":"Distributed Computing"},{"key":"33_CR8","volume-title":"Semantic Preorders in the Automated Verification of Concurrent Systems","author":"U. Celikkan","year":"1995","unstructured":"U. Celikkan. Semantic Preorders in the Automated Verification of Concurrent Systems. PhD thesis, North Carolina State University, Raleigh, 1995."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01211314","volume":"5","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland and M. C. B. Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5:1\u201320, 1993.","journal-title":"Formal Aspects of Computing"},{"key":"33_CR10","first-page":"50","volume":"17","author":"R. Cleaveland","year":"1996","unstructured":"R. Cleaveland, G. Luettgen, V. Natarajan, and S. Sims. Modeling and verifying distributed systems using priorities: A case study. Software Concepts and Tools, 17:50\u201362, 1996.","journal-title":"Software Concepts and Tools"},{"key":"33_CR11","unstructured":"R. J. Cleaveland and B. Ste\u00e9n. When is \u2018partial\u2019 adequate? a logic-based proof technique using partial specifications. In Proceedings of 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA, June 1990."},{"issue":"2","key":"33_CR12","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, March 1997.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1983","unstructured":"R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1983.","journal-title":"Theoretical Computer Science"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6423(90)90071-K","volume":"13","author":"J.-C. Fernandez","year":"1989","unstructured":"J.-C. Fernandez. An implementation of an efficient algorithm for bisimulation equivalence. Sicence of Computer Programming, 13:219\u2013236, 1989\/90.","journal-title":"Sicence of Computer Programming"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"M. Henzinger, T. Henzinger, and P. Kopke. Computing simulations on finite and infinite graphs. In 36th Annual IEEE Syposium on Foundations of Computer Science, pages 453\u2013462. Computer Society Press, 1995.","DOI":"10.1109\/SFCS.1995.492576"},{"key":"33_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/3-540-54430-5_99","volume-title":"CONCUR\u2019 91","author":"B. Jonsson","year":"1991","unstructured":"B. Jonsson. Simulations between specifications of distributed systems. In J.C.M. Baeten and J.F. Groote, editors, CONCUR\u2019 91, volume 527 of Lecture Notes in Computer Science, pages 346\u2013360, Amsterdam, August 1991. Springer-Verlag."},{"issue":"2","key":"33_CR17","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N. Lynch","year":"1995","unstructured":"N. Lynch and F. Vaandrager. Forward and backward simulations\u2014part i: Untimed systems. Information and Computation, 121(2):214\u2013233, September 1995.","journal-title":"Information and Computation"},{"key":"33_CR18","unstructured":"R. Milner. An algebraic definition of simulation between programs. In Proceedings of the Second International Joint Conference on Artificial Intelligence. BCS, 1971."},{"issue":"6","key":"33_CR19","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 of Computing, 16(6):973\u2013989, December 1987.","journal-title":"SIAM Journal of Computing"}],"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-45319-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T23:38:56Z","timestamp":1550446736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45319-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418658","9783540453192"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45319-9_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}