{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:16:05Z","timestamp":1759032965058},"reference-count":34,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4825,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0304-3975(99)00303-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:58:42Z","timestamp":1027612722000},"page":"81-130","source":"Crossref","is-referenced-by-count":24,"title":["Towards a unified view of bisimulation: a comparative study"],"prefix":"10.1016","volume":"238","author":[{"given":"Markus","family":"Roggenbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mila","family":"Majster-Cederbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00303-5_BIB1","doi-asserted-by":"crossref","unstructured":"S. Abramsky, Domain theory in logical form, Ann. Pure Appl. Logic (51) (1988) 1\u201377.","DOI":"10.1016\/0168-0072(91)90065-T"},{"issue":"2","key":"10.1016\/S0304-3975(99)00303-5_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/inco.1991.9999","article-title":"A domain equation for bisimulation","volume":"92","author":"Abramsky","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00303-5_BIB3","doi-asserted-by":"crossref","unstructured":"C. Autant, Z. Belmesk, Ph. Schnoebelen, Strong bisimilarity on nets revisited, Lecture Notes in Computer Science, vol. 506, Springer, Berlin, 1991, pp. 295\u2013312.","DOI":"10.1007\/978-3-662-25209-3_44"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB4","doi-asserted-by":"crossref","unstructured":"P. Aczel, Final universes of processes, Proc. 9th Internat. Conf. on Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, vol. 802, Springer, Berlin, 1994.","DOI":"10.1007\/3-540-58027-1_1"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB5","doi-asserted-by":"crossref","unstructured":"P. Aczel, N. Mendler, A final coalgebra theorem, Lecture Notes in Computer Science, vol. 389, Springer, Berlin, 1989, pp. 357\u2013365.","DOI":"10.1007\/BFb0018361"},{"issue":"3","key":"10.1016\/S0304-3975(99)00303-5_BIB6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01178506","article-title":"Concurrent bisimulations in Petri nets","volume":"28","author":"Best","year":"1991","journal-title":"Acta Inform."},{"issue":"1-2","key":"10.1016\/S0304-3975(99)00303-5_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(94)00152-9","article-title":"Structural operational semantics for weak bisimulations","volume":"146","author":"Bloom","year":"1995","journal-title":"Theoret. Comput. Sci."},{"issue":"1,2","key":"10.1016\/S0304-3975(99)00303-5_BIB8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","article-title":"Characterizing finite Kripke structures in propositional temporal logic","volume":"59","author":"Browne","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00303-5_BIB9","doi-asserted-by":"crossref","unstructured":"G.L. Cattani, J. Power, G. Winskel, A categorical axiomatics for bisimulation, Lecture Notes in Computer Science, vol. 1466, Springer, Berlin, 1998, pp. 581\u2013596.","DOI":"10.1007\/BFb0055649"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB10","doi-asserted-by":"crossref","unstructured":"A. Cheng, M. Nielsen, Open maps (at) work, Tech. Rep. RS-95-23, BRICS, 1995.","DOI":"10.7146\/brics.v2i23.19925"},{"issue":"1","key":"10.1016\/S0304-3975(99)00303-5_BIB11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0304-3975(93)90361-V","article-title":"Refinement of actions in event structures and causal trees","volume":"118","author":"Darondeau","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00303-5_BIB12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(93)90153-K","article-title":"Universal axioms for bisimulation","volume":"114","author":"Degano","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(99)00303-5_BIB13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0304-3975(92)90298-T","article-title":"Maximality preserving bisimulation","volume":"102","author":"Devillers","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00303-5_BIB14","doi-asserted-by":"crossref","unstructured":"R. De Nicola, U. Montanari, F.W. Vaandrager, Back and forth bisimulations, Lecture Notes in Computer Science, vol. 458, Springer, Berlin, 1990, pp. 152\u2013165.","DOI":"10.1007\/BFb0039058"},{"issue":"2","key":"10.1016\/S0304-3975(99)00303-5_BIB15","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1145\/201019.201032","article-title":"Three logics for branching bisimulation","volume":"42","author":"De Nicola","year":"1995","journal-title":"J. ACM"},{"issue":"1-2","key":"10.1016\/S0304-3975(99)00303-5_BIB16","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0304-3975(96)00281-2","article-title":"Essential transitions to bisimulation equivalences","volume":"179","author":"Eloranta","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00303-5_BIB17","series-title":"Proc. IFIP TC2 Working Conf. on Programming Concepts and Methods, Sea of Gallilea, Israel","article-title":"The refinement theorem for ST-bisimulation semantics","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB18","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek, U. Goltz, Equivalence notions for concurrent systems and refinement of actions, Lecture Notes in Computer Science, vol. 379, Springer, Berlin, 1989, pp. 237\u2013248.","DOI":"10.1007\/3-540-51486-4_71"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB19","doi-asserted-by":"crossref","unstructured":"R. van Glaabeek, U. Goltz, Equivalences and refinement, Lecture Notes in Computer Science, vol. 469, Springer, Berlin, 1990, pp. 309\u2013333.","DOI":"10.1007\/3-540-53479-2_13"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB20","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek, F. Vaandrager, Petri net models for algebraic theories of concurrency, Lecture Notes in Computer Science, vol. 259, Springer, Berlin, 1987, pp. 224\u2013242.","DOI":"10.1007\/3-540-17945-3_13"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB21","doi-asserted-by":"crossref","unstructured":"U. Goltz, R. Kuiper, W. Penczek, Propositional temporal logics and equivalences, Lecture Notes in Computer Science, vol. 630, Springer, Berlin, 1992, pp. 222\u2013236.","DOI":"10.1007\/BFb0084794"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB22","doi-asserted-by":"crossref","unstructured":"A. Joyal, M. Nielsen, G. Winskel, Bisimulation from open maps, Tech. Rep. RS-94-7, BRICS, 1994.","DOI":"10.7146\/brics.v1i7.21663"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(99)00303-5_BIB23","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(94)00047-M","article-title":"Studying equivalences of transition systems with algebraic tools","volume":"139","author":"Malacaria","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00303-5_BIB24","unstructured":"M. Majster-Cederbaum, M. Roggenbach, On two different characterizations of bisimulation, Bull. EATCS (59) (1996) 164\u2013172."},{"key":"10.1016\/S0304-3975(99)00303-5_BIB25","unstructured":"M. Majster-Cederbaum, M. Roggenbach, On an abstract characterization of bisimulation, in: Selected papers from 8th Nordic Workshop on Programming Theory, University of Oslo, 1997."},{"issue":"3","key":"10.1016\/S0304-3975(99)00303-5_BIB26","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0020-0190(98)00105-7","article-title":"Transition systems from event structures revisited","volume":"67","author":"Majster-Cederbaum","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00303-5_BIB27","doi-asserted-by":"crossref","unstructured":"R. Milner, A calculus of communicating systems, Lecture Notes in Computer Science, vol. 92, Springer, Berlin, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB28","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB29","doi-asserted-by":"crossref","unstructured":"R. Milner, Actions structures, 1992.","DOI":"10.1017\/S0960129500001407"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB30","doi-asserted-by":"crossref","unstructured":"M. Nielsen, G. Winskel, Petri nets and bisimulations, Tech. Rep. RS-95-4, BRICS, 1995.","DOI":"10.7146\/brics.v2i4.19506"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB31","doi-asserted-by":"crossref","unstructured":"D. Park, Concurrency and automata on infinite sequences, Lecture Notes in Computer Science, vol. 104, Springer, Berlin, 1981, pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S0304-3975(99)00303-5_BIB32","unstructured":"M. Roggenbach, \u00dcber abstrakte Charakterisierungen von Bisimulation, Ph.D. Thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Mannheim, 1998."},{"key":"10.1016\/S0304-3975(99)00303-5_BIB33","unstructured":"W. Vogler, Bisimulation and action refinement, Tech. Rep. SFB-Bericht NR.342\/10\/90 A, TU M\u00fcnchen, May 1990."},{"key":"10.1016\/S0304-3975(99)00303-5_BIB34","doi-asserted-by":"crossref","unstructured":"W. Vogler, Bisimulation and action refinement, Theoret. Comput. Sci. (114) (1993) 173\u2013200.","DOI":"10.1016\/0304-3975(93)90157-O"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003035?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003035?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T22:04:51Z","timestamp":1578693891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599003035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397599003035"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00303-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}