{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:23:56Z","timestamp":1758709436273},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T00:00:00Z","timestamp":1301011200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2011,4]]},"abstract":"<jats:p>Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic operations on a final coalgebra can be defined by distributive laws (of a syntax functor \u03a3 over a behaviour functor <jats:italic>F<\/jats:italic>). Such distributive laws correspond to abstract specification formats. One such format is a generalisation of the GSOS rules known from structural operational semantics of processes. We show that given an abstract GSOS specification \u03c1 that defines operations \u03c3 on a final <jats:italic>F<\/jats:italic>-coalgebra, we can systematically construct a GSOS specification <jats:overline>\u03c1<\/jats:overline> that defines the pointwise extension <jats:overline>\u03c3<\/jats:overline> of \u03c3 on a final <jats:italic>F<\/jats:italic><jats:sup><jats:italic>A<\/jats:italic><\/jats:sup>-coalgebra. The construction relies on the addition of a family of auxiliary \u2018buffer\u2019 operations to the syntax. These buffer operations depend only on <jats:italic>A<\/jats:italic>, so the construction is uniform for all \u03c3 and <jats:italic>F<\/jats:italic>.<\/jats:p>","DOI":"10.1017\/s096012951000054x","type":"journal-article","created":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T11:52:40Z","timestamp":1301053960000},"page":"321-361","source":"Crossref","is-referenced-by-count":6,"title":["Pointwise extensions of GSOS-defined operations"],"prefix":"10.1017","volume":"21","author":[{"given":"HELLE HVID","family":"HANSEN","sequence":"first","affiliation":[]},{"given":"BARTEK","family":"KLIN","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2011,3,25]]},"reference":[{"key":"S096012951000054X_ref13","doi-asserted-by":"publisher","DOI":"10.1081\/AGB-120016005"},{"key":"S096012951000054X_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2007.10.006"},{"key":"S096012951000054X_ref3","unstructured":"Bartels F. (2004) On Generalised Coinduction and Probabilistic Specification Formats, Ph.D. thesis, Vrije Universiteit Amsterdam."},{"key":"S096012951000054X_ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0208011"},{"key":"S096012951000054X_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482830-9\/50021-7"},{"key":"S096012951000054X_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(99)00093-6"},{"key":"S096012951000054X_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0018361"},{"key":"S096012951000054X_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013108"},{"key":"S096012951000054X_ref5","unstructured":"Hansen H. and Klin B. (2010) Pointwise extensions of GSOS-defined operations (extended abstract). In: CMCS 10 \u2013 Short Contributions. CWI Technical Report, SEN-1004, Centrum Wiskunde & Informatica, Amsterdam, The Netherlands 10\u201311."},{"key":"S096012951000054X_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/11780274_20"},{"key":"S096012951000054X_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1112-9"},{"key":"S096012951000054X_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00895-2"},{"key":"S096012951000054X_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01110627"},{"key":"S096012951000054X_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.07.024"},{"key":"S096012951000054X_ref14","unstructured":"Rutten J. (1991) Coalgebra, concurrency and control. CWI Research Report SEN-9921, Centrum Wiskunde & Informatica, Amsterdam, The Netherlands"},{"key":"S096012951000054X_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"S096012951000054X_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.05.030"},{"key":"S096012951000054X_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58043-3_28"},{"key":"S096012951000054X_ref20","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1109\/LICS.1997.614955","volume-title":"Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS 1997)","author":"Turi","year":"1997"},{"key":"S096012951000054X_ref6","first-page":"97","article-title":"Symbolic synthesis of Mealy machines from arithmetic bitstream functions","volume":"XX","author":"Hansen","year":"2010","journal-title":"Scientific Annals of Computer Science"},{"key":"S096012951000054X_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.009"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S096012951000054X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T19:04:49Z","timestamp":1556391889000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S096012951000054X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,25]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["S096012951000054X"],"URL":"https:\/\/doi.org\/10.1017\/s096012951000054x","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,25]]}}}