{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:26:47Z","timestamp":1761596807210},"reference-count":35,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3552,"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":[[2003,12]]},"DOI":"10.1016\/s0304-3975(03)00277-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"313-355","source":"Crossref","is-referenced-by-count":12,"title":["Branching time and orthogonal bisimulation equivalence"],"prefix":"10.1016","volume":"309","author":[{"given":"Jan A.","family":"Bergstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alban","family":"Ponse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark B.","family":"van der Zwaag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00277-9_BIB1","first-page":"127","article-title":"Syntax and defining equations for an interrupt mechanism in process algebra","volume":"IX","author":"Baeten","year":"1986","journal-title":"Fund. Inform."},{"issue":"1\/2","key":"10.1016\/S0304-3975(03)00277-9_BIB2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","article-title":"On the consistency of Koomen's fair abstraction rule","volume":"51","author":"Baeten","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00277-9_BIB3","series-title":"Proc. 14th Internat. Colloq. on Automata, Languages and Programming (ICALP\u201987)","first-page":"84","article-title":"Another look at abstraction in process algebra (extended abstract)","volume":"Vol. 267","author":"Baeten","year":"1987"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB4","unstructured":"J.C.M. Baeten, C. Verhoef, Concrete process algebra, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. 4, Oxford University Press, Oxford, 1995, pp. 149\u2013268."},{"key":"10.1016\/S0304-3975(03)00277-9_BIB5","unstructured":"J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, Vol. 18, Cambridge University Press, Cambridge, 1990."},{"issue":"4","key":"10.1016\/S0304-3975(03)00277-9_BIB6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/comjnl\/37.4.243","article-title":"Process algebra with iteration and nesting","volume":"37","author":"Bergstra","year":"1994","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(03)00277-9_BIB7","series-title":"Handbook of Process Algebra","first-page":"333","article-title":"Process algebra with recursive operations","author":"Bergstra","year":"2001"},{"issue":"1\u20133","key":"10.1016\/S0304-3975(03)00277-9_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Inform. and Control"},{"issue":"1","key":"10.1016\/S0304-3975(03)00277-9_BIB9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra of communicating processes with abstraction","volume":"37","author":"Bergstra","year":"1985","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(03)00277-9_BIB10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0304-3975(00)00413-8","article-title":"Non-regular iterators in process algebra","volume":"269","author":"Bergstra","year":"2001","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"10.1016\/S0304-3975(03)00277-9_BIB11","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1145\/504794.504799","article-title":"Register-machine based processes","volume":"48","author":"Bergstra","year":"2001","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/S0304-3975(03)00277-9_BIB12","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1145\/234752.234756","article-title":"The meaning of negative premises in transition system specifications","volume":"43","author":"Bol","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB13","series-title":"Handbook of Process Algebra","first-page":"293","article-title":"Modal logics and mu-calculi: an introduction","author":"Bradfield","year":"2001"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB14","series-title":"Handbook of Process Algebra","first-page":"711","article-title":"Priority in process algebra","author":"Cleaveland","year":"2001"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB15","series-title":"Introduction to Process Algebra, Texts in Theoretical Computer Science","author":"Fokkink","year":"2000"},{"issue":"4","key":"10.1016\/S0304-3975(03)00277-9_BIB16","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1093\/comjnl\/37.4.259","article-title":"Basic process algebra with iteration","volume":"37","author":"Fokkink","year":"1994","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(03)00277-9_BIB17","unstructured":"R.J. van Glabbeek, The linear time\u2013branching time spectrum II; the semantics of sequential systems with silent moves, Manuscript. Preliminary version available by ftp at ftp:\/\/boole.stanford.edu\/-pub\/-spectrum.ps.gz. Extended abstract in: E. Best (Ed.), CONCUR\u201993, 4th Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 715, Springer, Berlin, 1993."},{"key":"10.1016\/S0304-3975(03)00277-9_BIB18","series-title":"Proc. Mathematical Foundations of Computer Science 1993 (MFCS)","first-page":"473","article-title":"A complete axiomatization for branching bisimulation congruence of finite-state behaviours","volume":"Vol. 711","author":"van Glabbeek","year":"1993"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB19","unstructured":"R.J. van Glabbeek, What is branching time semantics and why to use it? Bull. EATCS 53 (1994), 190\u2013198; M. Nielsen (Ed.), The Concurrency Column."},{"key":"10.1016\/S0304-3975(03)00277-9_BIB20","series-title":"Handbook of Process Algebra","first-page":"3","article-title":"The linear time\u2013branching time spectrum I; the semantics of concrete, sequential processes","author":"van Glabbeek","year":"2001"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB21","series-title":"Information Processing 89, Proc. IFIP 11th World Computer Congress","first-page":"613","article-title":"Branching time and abstraction in bisimulation semantics (extended abstract)","author":"van Glabbeek","year":"1989"},{"issue":"3","key":"10.1016\/S0304-3975(03)00277-9_BIB22","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","article-title":"Branching time and abstraction in bisimulation semantics","volume":"43","author":"van Glabbeek","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB23","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB24","article-title":"A Calculus of Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB25","series-title":"Proc. CAAP 81","first-page":"25","article-title":"Modal characterisation of observable machine behaviour","volume":"Vol. 112","author":"Milner","year":"1981"},{"issue":"3","key":"10.1016\/S0304-3975(03)00277-9_BIB26","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"28","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00277-9_BIB27","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB28","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"issue":"2","key":"10.1016\/S0304-3975(03)00277-9_BIB29","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"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB30","series-title":"5th GI Conf","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB31","doi-asserted-by":"crossref","unstructured":"C. Sterling, Modal and temporal logics for processes, Logics for Concurrency, Lecture Notes in Computer Science, Vol. 1043, Springer, Berlin, 1996, pp. 149\u2013237.","DOI":"10.1007\/3-540-60915-6_5"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB32","series-title":"Computer Networks","author":"Tanenbaum","year":"1989"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB33","series-title":"Applications of Process Algebra","first-page":"23","article-title":"Two simple protocols","volume":"Vol. 17","author":"Vaandrager","year":"1990"},{"key":"10.1016\/S0304-3975(03)00277-9_BIB34","unstructured":"M.B. van der Zwaag, Some verifications in process algebra with iota, Report P9806, Programming Research Group, University of Amsterdam, 1998."},{"key":"10.1016\/S0304-3975(03)00277-9_BIB35","series-title":"Proc. Third Internat. Workshop on Formal Methods for Industrial Critical Systems","first-page":"347","article-title":"A verification in process algebra with iota","author":"van der Zwaag","year":"1998"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002779?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002779?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:52:34Z","timestamp":1553158354000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503002779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":35,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0304397503002779"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00277-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}