{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:33:43Z","timestamp":1777646023812,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[1997,5]]},"abstract":"<jats:p>The algebraic transformation of hypergraphs, under the so-called double-pushout (DPO) approach, was invented more than two decades ago, and thoroughly developed since then. We introduce in this paper a new approach to DPO algebraic transformation of hypergraphs and, more in general, of unary partial algebras, which generalizes the aforementioned \u201cclassical\u201d DPO approach to hypergraph transformation. While the classical approach was based on the (usual) homomorphisms of hypergraphs, our new approach is based on the total conformisms, a type of morphisms of hypergraphs imported from the theory of partial algebras, which can be described, roughly speaking, as those mappings between hypergraphs that \u201creflect\u201d the structure of the target object. In this paper we give both an algebraic and an operational characterization of this new DPO transformation, first for unary partial algebras and then, as a particular case, for hypergraphs. We also study its abstract properties related to parallelism and concurrency through the determination of the HLR conditions it satisfies with respect to several natural classes of morphisms.<\/jats:p>","DOI":"10.3233\/fi-1997-30206","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T21:09:24Z","timestamp":1575320964000},"page":"193-226","source":"Crossref","is-referenced-by-count":0,"title":["Double-pushout hypergraph rewriting using total conformisms"],"prefix":"10.1177","volume":"30","author":[{"given":"Merc\u00e8","family":"Llabr\u00e9s","sequence":"first","affiliation":[{"name":"Departament de Ci\u00e8ncies Matem\u00e0tiques i Inform\u00e0tica, Universitat de les Illes Balears, E-07071 Palma de Mallorca, Spain. {merce,cesc}@ipc4.uib.es"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesc","family":"Rossell\u00f3","sequence":"additional","affiliation":[{"name":"Departament de Ci\u00e8ncies Matem\u00e0tiques i Inform\u00e0tica, Universitat de les Illes Balears, E-07071 Palma de Mallorca, Spain. {merce,cesc}@ipc4.uib.es"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[1997,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-1997-30206","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-1997-30206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:34:05Z","timestamp":1777444445000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-1997-30206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1,1]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["10.3233\/FI-1997-30206"],"URL":"https:\/\/doi.org\/10.3233\/fi-1997-30206","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1,1]]}}}