{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:06Z","timestamp":1753894386373,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T00:00:00Z","timestamp":1641945600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Reactive systems \\`a la Leifer and Milner, an abstract categorical framework\nfor rewriting, provide a suitable framework for deriving bisimulation\ncongruences. This is done by synthesizing interactions with the environment in\norder to obtain a compositional semantics.\n  We enrich the notion of reactive systems by conditions on two levels: first,\nas in earlier work, we consider rules enriched with application conditions and\nsecond, we investigate the notion of conditional bisimilarity. Conditional\nbisimilarity allows us to say that two system states are bisimilar provided\nthat the environment satisfies a given condition.\n  We present several equivalent definitions of conditional bisimilarity,\nincluding one that is useful for concrete proofs and that employs an\nup-to-context technique, and we compare with related behavioural equivalences.\nWe consider examples based on DPO graph rewriting, an instantiation of reactive\nsystems.<\/jats:p>","DOI":"10.46298\/lmcs-18(1:6)2022","type":"journal-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T17:31:40Z","timestamp":1642095100000},"source":"Crossref","is-referenced-by-count":1,"title":["Conditional Bisimilarity for Reactive Systems"],"prefix":"10.46298","volume":"Volume 18, Issue 1","author":[{"given":"Mathias","family":"H\u00fclsbusch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"K\u00fcpper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lara","family":"Stoltenow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2022,1,12]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/8951\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/8951\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T08:00:39Z","timestamp":1689753639000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/6937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,12]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(1:6)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2004.11792v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2004.11792v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2004.11792","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2004.11792","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2022,1,12]]},"article-number":"6937"}}