{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:23Z","timestamp":1761611063828},"reference-count":14,"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(98)00176-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:58:42Z","timestamp":1027612722000},"page":"275-311","source":"Crossref","is-referenced-by-count":12,"title":["Fixpoint semantics and simulation"],"prefix":"10.1016","volume":"238","author":[{"given":"Wim H.","family":"Hesselink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Thijs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00176-5_BIB1","doi-asserted-by":"crossref","unstructured":"P. Aczel, N. Mendler, A final coalgebra theorem, in: D.H. Pitt, D.E. Rydeheard, P. Dybjer, A.M. Pitts. A. Poign\u00e9 (Eds.), Category Theory and Computer Science, Proceedings, Manchester, Lecture Notes in Computer Science, 389, Springer, Berlin, 1989, pp. 357\u2013365.","DOI":"10.1007\/BFb0018361"},{"key":"10.1016\/S0304-3975(98)00176-5_BIB2","doi-asserted-by":"crossref","unstructured":"R. Backhouse, J. van der Woude, Lecture Notes of the STOP 1992 Summerschool on Constructive Algorithms, 1992.","DOI":"10.1080\/10506899208260792"},{"key":"10.1016\/S0304-3975(98)00176-5_BIB3","doi-asserted-by":"crossref","unstructured":"G. Birkhoff, On the structure of abstract algebras, Proc. Cambridge Philos. Soc. 31 (1935).","DOI":"10.1017\/S0305004100013463"},{"key":"10.1016\/S0304-3975(98)00176-5_BIB4","series-title":"Predicate Calculus and Program Semantics","author":"Dijkstra","year":"1990"},{"key":"10.1016\/S0304-3975(98)00176-5_BIB5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(88)90143-0","article-title":"Deadlock and fairness in morphisms of transition systems","volume":"59","author":"Hesselink","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00176-5_BIB6","doi-asserted-by":"crossref","unstructured":"W.H. Hesselink, Programs, Recursion and Unbounded Choice, Predicate Transformation Semantics and Transformation Rules. Cambridge Tracts in Theoretical Computer Science, vol. 27, Cambridge University Press, Cambridge, 1992.","DOI":"10.1017\/CBO9780511569784"},{"key":"10.1016\/S0304-3975(98)00176-5_BIB7","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(98)00176-5_BIB8","unstructured":"E. Meier, Calculating compilers, Thesis Nijmegen, 1992."},{"key":"10.1016\/S0304-3975(98)00176-5_BIB9","unstructured":"R. Milner, An algebraic definition of simulation between programs, Proc. 2nd Internat. Joint Conf. on Artificial Intelligence, British Comp. Soc., 1971."},{"key":"10.1016\/S0304-3975(98)00176-5_BIB10","doi-asserted-by":"crossref","unstructured":"Y.N. Moschovakis, The logic of functional recursion, in: M.L. Dalla Chiara et al. (Eds.), Logic and Scientific Methods, Kluwer, Dordrcht, 1997, pp. 179\u2013207.","DOI":"10.1007\/978-94-017-0487-8_10"},{"key":"10.1016\/S0304-3975(98)00176-5_BIB11","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"vol 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(98)00176-5_BIB12","series-title":"Proc. REX Workshop on Semantics","first-page":"477","article-title":"On the foundations of final semantics","author":"Rutten","year":"1993"},{"key":"10.1016\/S0304-3975(98)00176-5_BIB13","series-title":"Introduction to Axiomatic Set Theory","author":"Takeuti","year":"1971"},{"key":"10.1016\/S0304-3975(98)00176-5_BIB14","unstructured":"A.M. Thijs, Simulation and fixpoint semantics, Thesis, Groningen, 1996."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001765?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001765?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T14:56:33Z","timestamp":1556290593000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397598001765"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00176-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}