{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:53Z","timestamp":1761611093517},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":[[1997,6]]},"abstract":"<jats:p>A large number of observational semantics for process description \nlanguages have been \ndeveloped, many of which are based on the notion of bisimulation. In this\n paper, we \nconsider in detail the problem of defining a semantic framework to unify\n these. The \ndiscussion takes place in a purely algebraic setting. We introduce a \nspecial class of algebras \ncalled <jats:italic>Structured Transition Systems<\/jats:italic>. A structured transition\n system can \nbe viewed as a \ntransition system with an algebraic structure both on states and \ntransitions. In this \nframework, observations of behaviours are dealt with by means of maps \nfrom the transitions to some algebra of observations.<\/jats:p><jats:p>Using several examples, we show that this framework allows us to \ndescribe a range of \nobservational semantics within a single underlying presentation: it is \nenough to consider \ndifferent mappings and algebras of observations. Furthermore, we introduce \na notion of \nbisimulation that is parameterized with respect to the choice of the \nalgebra of observations, \nand we find circumstances under which a Structured Transition System \nhas good properties \nwith respect to this parameterized bisimulation.<\/jats:p><jats:p>First, some general syntactic constraints, independent from the choice \nof the algebra of \nthe observations, are given for Structured Transition System presentations. \nWe show that \nthese constraints ensure that parameterized bisimulation is always a \ncongruence. Next, we \naddress the problem of <jats:italic>Minimal Realizations<\/jats:italic>. We show that when \nthe presentation satisfies \nthe syntactic constraints there exists a minimal realization, <jats:italic>i.e.<\/jats:italic>, \nthere is a model of the \npresentation whose elements fully characterize congruence classes under\n bisimulation.<\/jats:p>","DOI":"10.1017\/s0960129597002284","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:29:40Z","timestamp":1027762180000},"page":"241-282","source":"Crossref","is-referenced-by-count":7,"title":["Structured transition systems with parametric observations: observational \ncongruences and minimal realizations"],"prefix":"10.1017","volume":"7","author":[{"given":"GIANLUIGI","family":"FERRARI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"UGO","family":"MONTANARI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MIRANDA","family":"MOWBRAY","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[1997,6,1]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129597002284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T16:47:13Z","timestamp":1557593233000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129597002284\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0960129597002284"],"URL":"https:\/\/doi.org\/10.1017\/s0960129597002284","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}