{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:52Z","timestamp":1763467492144},"reference-count":45,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":5160,"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":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00035-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"271-293","source":"Crossref","is-referenced-by-count":88,"title":["Bisimulation for probabilistic transition systems: a coalgebraic approach"],"prefix":"10.1016","volume":"221","author":[{"given":"E.P.","family":"de Vink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.J.M.M.","family":"Rutten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00035-3_bib1","article-title":"Non-Well-Founded Sets","volume":"vol. 14","author":"Aczel","year":"1988"},{"key":"10.1016\/S0304-3975(99)00035-3_bib2","series-title":"Proc. Category Theory and Computer Science","first-page":"357","article-title":"A final coalgebra theorem","volume":"vol. 389","author":"Aczel","year":"1989"},{"key":"10.1016\/S0304-3975(99)00035-3_bib3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0022-0000(89)90027-5","article-title":"Solving reflexive domain equations in a category of complete metric spaces","volume":"39","author":"America","year":"1989","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0304-3975(99)00035-3_SB0020","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","article-title":"Terminal coalgebras in well-founded set theory","volume":"114","author":"Barr","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00035-3_SB0025","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(94)90060-4","volume":"124","author":"Barr","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00035-3_bib5","series-title":"Proc. 12 Annual IEEE Symp. On Logic In Computer Science","first-page":"149","article-title":"Bisimulation for labeled Markov processes","author":"Blute","year":"1997"},{"key":"10.1016\/S0304-3975(99)00035-3_bib6","series-title":"Proc. CONCUR'96","first-page":"315","article-title":"Extended Markovian process algebra","volume":"vol. 1119","author":"Bernardo","year":"1996"},{"key":"10.1016\/S0304-3975(99)00035-3_SB0040","article-title":"Domain equations for probabilistic processes","author":"Baier","year":"1997"},{"key":"10.1016\/S0304-3975(99)00035-3_SB0045","series-title":"Proc. EXPRESS'97","volume":"vol. 7","author":"Baier","year":"1997"},{"key":"10.1016\/S0304-3975(99)00035-3_bib8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(94)00295-1","article-title":"A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic\/nonstochastic systems","volume":"152","author":"Benveniste","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00035-3_bib9","volume":"vol. 63","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/S0304-3975(99)00035-3_SB0060","article-title":"Topological Dualities in Semantics","author":"Bonsangue","year":"1996"},{"key":"10.1016\/S0304-3975(99)00035-3_SB0065","volume":"vol. 8","author":"Bonsangue","year":"1997"},{"key":"10.1016\/S0304-3975(99)00035-3_bib11","series-title":"Control Flow Semantics","author":"de Bakker","year":"1996"},{"key":"10.1016\/S0304-3975(99)00035-3_bib12","series-title":"Proc. 13th Annual IEEE Symp. On Logic In Computer Science","first-page":"478","article-title":"A logical characterization of bisimulation for labeled Markov processes","author":"Desharnais","year":"1998"},{"key":"10.1016\/S0304-3975(99)00035-3_bib13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(95)00050-7","article-title":"Domain theory and integration","volume":"151","author":"Edalat","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00035-3_bib14","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1006\/inco.1995.1096","article-title":"Dynamical systems, measures and fractals via domain theory","volume":"120","author":"Edalat","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00035-3_bib15","series-title":"Proc. Categorical Aspects of Topology and Analysis","first-page":"68","article-title":"A categorical approach to probability theory","volume":"vol. 915","author":"Giry","year":"1981"},{"key":"10.1016\/S0304-3975(99)00035-3_bib16","series-title":"Proc. Working Conference on Programming Concepts and Methods, IFIP TC2","article-title":"Algebraic reasoning for probabilistic concurrent systems","author":"Giacalone","year":"1990"},{"key":"10.1016\/S0304-3975(99)00035-3_SB0100","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1995.1123","article-title":"Reactive, generative and stratified models of probabilistic processes","volume":"121","author":"van Glabbeek","year":"1995","journal-title":"Informat. Comput."},{"key":"10.1016\/S0304-3975(99)00035-3_SB0105","series-title":"Proc. LICS'90","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/S0304-3975(99)00035-3_bib18","series-title":"Proc. ICALP'95","first-page":"324","article-title":"Hybrid automata with finite bisimulations","volume":"vol. 944","author":"Henzinger","year":"1995"},{"key":"10.1016\/S0304-3975(99)00035-3_bib19","series-title":"Object-Orientation with Parallelism and Persistence","article-title":"Objects and classes, co-algebraically","author":"Jacobs","year":"1996"},{"key":"10.1016\/S0304-3975(99)00035-3_bib20","series-title":"Proc. LICS'91","first-page":"266","article-title":"Specification and refinement of probabilistic processes","author":"Jonsson","year":"1991"},{"key":"10.1016\/S0304-3975(99)00035-3_bib21","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1006\/inco.1996.0057","article-title":"Bisimulation from open maps","volume":"127","author":"Joyal","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00035-3_bib22","article-title":"Probabilistic non-determinism","author":"Jones","year":"1989"},{"key":"10.1016\/S0304-3975(99)00035-3_bib23","series-title":"Proc. LICS'89","first-page":"186","article-title":"A probabilistic powerdomain of evaluations","author":"Jones","year":"1989"},{"key":"10.1016\/S0304-3975(99)00035-3_bib24","first-page":"222","article-title":"A tutorial on (co)algebras and (co)induction","volume":"62","author":"Jacobs","year":"1997","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(99)00035-3_bib25","article-title":"Classical Descriptive Set Theory","volume":"vol. 156","author":"Kechris","year":"1995"},{"key":"10.1016\/S0304-3975(99)00035-3_bib26","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verification of parallel programs","volume":"19","author":"Keller","year":"1976","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(99)00035-3_bib27","series-title":"Proc. MFCS'96","first-page":"419","article-title":"Probabilistic metric semantics for a simple language with recursion","volume":"vol. 1113","author":"Kwiatkowska","year":"1996"},{"key":"10.1016\/S0304-3975(99)00035-3_bib28","year":"1984"},{"key":"10.1016\/S0304-3975(99)00035-3_bib29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","article-title":"Bisimulation through probabilistic testing","volume":"94","author":"Larsen","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00035-3_bib30","series-title":"Algebraic Methods in Semantics","first-page":"459","article-title":"Initiality, induction, and computability","author":"Meseguer","year":"1985"},{"key":"10.1016\/S0304-3975(99)00035-3_bib31","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","article-title":"A Calculus of Communicating Systems","volume":"vol. 92","author":"Milner","year":"1980","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0304-3975(99)00035-3_bib32","article-title":"Coalgebraic logic","author":"Moss","year":"1997","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(99)00035-3_bib33","series-title":"Proc. 5th GI Conf. on Theoretical Computer Science","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(99)00035-3_bib34","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/S0304-3975(99)00035-3_bib35","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1017\/S0960129500000694","article-title":"An approach to object semantics based on terminal coalgebras","volume":"5","author":"Reichel","year":"1995","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00035-3_bib36","series-title":"Proc. REX Workshop on Semantics: Foundations and Applications","first-page":"477","article-title":"On the foundations of final semantics: non-standard sets, metric spaces, partial orders","volume":"vol. 666","author":"Rutten","year":"1993"},{"key":"10.1016\/S0304-3975(99)00035-3_bib37","series-title":"Proc. REX School\/Symposium \u2018A Decade of Concurrency\u2019","first-page":"530","article-title":"Initial algebra and final coalgebra semantics for concurrency","volume":"vol. 803","author":"Rutten","year":"1994"},{"key":"10.1016\/S0304-3975(99)00035-3_bib38","series-title":"Real and Complex Analysis","author":"Rudin","year":"1966"},{"key":"10.1016\/S0304-3975(99)00035-3_bib39","series-title":"Theoretical Computer Science","article-title":"Universal coalgebra: a theory of systems","author":"Rutten","year":"1996"},{"key":"10.1016\/S0304-3975(99)00035-3_bib40","article-title":"Modeling and Verification of Randomized Distributed Real-Time Systems","author":"Segala","year":"1995"},{"key":"10.1016\/S0304-3975(99)00035-3_bib41","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0304-3975(94)00286-0","article-title":"Probabilistic communicating processes","volume":"152","author":"Seidel","year":"1995","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000353?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000353?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:21:13Z","timestamp":1555420873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":45,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000353"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00035-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}