{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:58Z","timestamp":1759637878869,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2008,10,21]],"date-time":"2008-10-21T00:00:00Z","timestamp":1224547200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We propose a framework for the specification of behaviour-preserving\nreconfigurations of systems modelled as Petri nets. The framework is based on\nopen nets, a mild generalisation of ordinary Place\/Transition nets suited to\nmodel open systems which might interact with the surrounding environment and\nendowed with a colimit-based composition operation. We show that natural\nnotions of bisimilarity over open nets are congruences with respect to the\ncomposition operation. The considered behavioural equivalences differ for the\nchoice of the observations, which can be single firings or parallel steps.\nAdditionally, we consider weak forms of such equivalences, arising in the\npresence of unobservable actions. We also provide an up-to technique for\nfacilitating bisimilarity proofs. The theory is used to identify suitable\nclasses of reconfiguration rules (in the double-pushout approach to rewriting)\nwhose application preserves the observational semantics of the net.<\/jats:p>","DOI":"10.2168\/lmcs-4(4:3)2008","type":"journal-article","created":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T10:25:08Z","timestamp":1231496708000},"source":"Crossref","is-referenced-by-count":5,"title":["Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets"],"prefix":"10.46298","volume":"Volume 4, Issue 4","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6123-4175","authenticated-orcid":false,"given":"Andrea","family":"Corradini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hartmut","family":"Ehrig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reiko","family":"Heckel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2008,10,21]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1165\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1165\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:05:23Z","timestamp":1681243523000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,21]]},"references-count":0,"URL":"https:\/\/doi.org\/10.2168\/lmcs-4(4:3)2008","relation":{"is-same-as":[{"id-type":"arxiv","id":"0809.4115","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.0809.4115","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/978-3-540-73859-6_9","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2008,10,21]]},"article-number":"1165"}}