{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:46:52Z","timestamp":1762458412200},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3954,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s1571-0661(04)80358-x","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T19:29:25Z","timestamp":1096399765000},"page":"29-53","source":"Crossref","is-referenced-by-count":19,"title":["GSOS for probabilistic transition systems"],"prefix":"10.1016","volume":"65","author":[{"given":"Falk","family":"Bartels","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Peter Aczel and Nax Mendler. A final coalgebra theorem. In D.H. Pitt, D.E. Rydeheard, P. Dybjer, A.M. Pitts, and A. Poign\u00e9, editors, Proc. 3rd CTCS, volume 389 of Lecture Notes in Computer Science, pages 357\u2013365. Springer-Verlag, Berlin, 1989.","DOI":"10.1007\/BFb0018361"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Falk Bartels. Generalised coinduction. In Andrea Corradini, Marina Lenisa, and Ugo Montanari, editors, Proc. Coalgebraic Methods in Computer Science (CMCS 2001), volume 44 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001.","DOI":"10.1016\/S1571-0661(04)80903-4"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Falk Bartels. GSOS for probabilistic transition systems. Technical Report SEN-R02??, CWI, Amsterdam, to appear 2002.","DOI":"10.1016\/S1571-0661(04)80358-X"},{"issue":"1","key":"10.1016\/S1571-0661(04)80358-X_NEWBIB4","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation can't be traced","volume":"42","author":"Bloom","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB5","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(99)00035-3","article-title":"Bisimulation for probabilistic transition systems: A coalgebraic approach","volume":"221","author":"de Vink","year":"1999","journal-title":"TCS: Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB6","series-title":"Handbook of Process Algebra","first-page":"685","article-title":"Probabilistic extensions of process algebras","author":"Jonsson","year":"2001"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB7","first-page":"222","article-title":"A tutorial on (co)algebras and (co)induction","volume":"62","author":"Jacobs","year":"1996","journal-title":"Bulletin of the EATCS"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB8","doi-asserted-by":"crossref","unstructured":"M. Kick. Bialgebraic modelling of timed processes. In Proceedings ICALP'02, Lecture Notes in Computer Science. Springer, to appear 2002.","DOI":"10.1007\/3-540-45465-9_45"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Marina Lenisa, John Power, and Hiroshi Watanabe. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. In Horst Reichel, editor, Proc. Coalgebraic Methods in Computer Science (CMCS 2000), volume 33 of Electronic Notes in Theoretical Computer Science, pages 233\u2013263. Elsevier Science Publishers, 2000.","DOI":"10.1016\/S1571-0661(05)80350-0"},{"issue":"1","key":"10.1016\/S1571-0661(04)80358-X_NEWBIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","article-title":"Bisimulation through probabilistic testing","volume":"94","author":"Kim Larsen","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Kim G. Larsen and Arne Skou. Compositional verification of probabilistic processes. In W. R. Cleaveland, editor, CONCUR '92: Third International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 456\u2013471, Stony Brook, New York, 1992. Springer-Verlag.","DOI":"10.1007\/BFb0084809"},{"issue":"1","key":"10.1016\/S1571-0661(04)80358-X_NEWBIB13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","article-title":"Universal coalgebra: A theory of systems","volume":"249","author":"Rutten","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB14","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1017\/S0960129598002527","article-title":"On the bisimulation proof method","volume":"8","author":"Sangiorgi","year":"1998","journal-title":"Journal of Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB15","doi-asserted-by":"crossref","unstructured":"Daniele Turi and Gordon D. Plotkin. Towards a mathematical operational semantics. In Proc. 12th LICS Conf., pages 280\u2013291. IEEE, Computer Society Press, 1997.","DOI":"10.1109\/LICS.1997.614955"},{"key":"10.1016\/S1571-0661(04)80358-X_NEWBIB16","doi-asserted-by":"crossref","unstructured":"Daniele Turi. Categorical modelling of structural operational rules: case studies. In E. Moggi and G. Rosolini, editors, Proc. 7th CTCS Conf., volume 1290 of LNCS, pages 127\u2013146. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0026985"},{"issue":"1","key":"10.1016\/S1571-0661(04)80358-X_NEWBIB17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1995.1123","article-title":"Smolka, and Bernhard Steffen. Reactive, generative and stratified models of probabilistic processes","volume":"121","author":"Rob van Glabbeek","year":"1995","journal-title":"Information and Computation"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480358X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480358X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T12:22:46Z","timestamp":1549196566000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610480358X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S157106610480358X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80358-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}