{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T18:50:32Z","timestamp":1791139832825,"version":"4.1.0"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T00:00:00Z","timestamp":1379376000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["257414"],"award-info":[{"award-number":["257414"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>A quite flourishing research thread in the recent literature on\ncomponent-based systems is concerned with the algebraic properties of different\nclasses of connectors. In a recent paper, an algebra of stateless connectors\nwas presented that consists of five kinds of basic connectors, namely symmetry,\nsynchronization, mutual exclusion, hiding and inaction, plus their duals, and\nit was shown how they can be freely composed in series and in parallel to model\nsophisticated 'glues'. In this paper we explore the expressiveness of stateful\nconnectors obtained by adding one-place buffers or unbounded buffers to the\nstateless connectors. The main results are: i) we show how different classes of\nconnectors exactly correspond to suitable classes of Petri nets equipped with\ncompositional interfaces, called nets with boundaries; ii) we show that the\ndifference between strong and weak semantics in stateful connectors is\nreflected in the semantics of nets with boundaries by moving from the classic\nstep semantics (strong case) to a novel banking semantics (weak case), where a\nstep can be executed by taking some 'debit' tokens to be given back during the\nsame step; iii) we show that the corresponding bisimilarities are congruences\n(w.r.t. composition of connectors in series and in parallel); iv) we show that\nsuitable monoidality laws, like those arising when representing stateful\nconnectors in the tile model, can nicely capture concurrency (in the sense of\nstep semantics) aspects; and v) as a side result, we provide a basic algebra,\nwith a finite set of symbols, out of which we can compose all P\/T nets with\nboundaries, fulfilling a long standing quest.<\/jats:p>","DOI":"10.2168\/lmcs-9(3:16)2013","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:44:29Z","timestamp":1385732669000},"source":"Crossref","is-referenced-by-count":23,"title":["Connector algebras for C\/E and P\/T nets' interactions"],"prefix":"10.46298","volume":"Volume 9, Issue 3","author":[{"given":"Roberto","family":"Bruni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hernan","family":"Melgratti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7992-9685","authenticated-orcid":false,"given":"Pawel","family":"Sobocinski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2013,9,17]]},"reference":[{"key":"753:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/883\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/883\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:58:26Z","timestamp":1681243106000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,17]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(3:16)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1307.0204","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1307.0204","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1908.11769","asserted-by":"subject"},{"id-type":"doi","id":"10.1017\/s1471068419000425","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arxiv.1908.11769","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,17]]},"article-number":"883"}}