{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:03:35Z","timestamp":1773324215686,"version":"3.50.1"},"reference-count":45,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T00:00:00Z","timestamp":1236124800000},"content-version":"unspecified","delay-in-days":5025,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[1995,6]]},"abstract":"<jats:p>The concept of algebraic high-level net transformation systems combines two important lines of research recently introduced in the literature:<jats:italic>algebraic high-level nets<\/jats:italic>(AHL-nets for short) and<jats:italic>high-level replacement systems<\/jats:italic>(HLR-systems for short). In both cases a categorical formulation of the corresponding theory has turned out to be highly important and is also a good basis for the integration of these concepts in this paper.<\/jats:p><jats:p>AHL-nets combine Petri nets with algebraic specifications and provide a powerful specification technique for distributed systems including data types and processes.<\/jats:p><jats:p>HLR-systems are transformation systems for high-level structures such as graphs, hypergraphs, algebraic specifications and different kinds of Petri nets. The theory of HLRsystems - formulated already in a categorical framework - is applied in this paper to AHLnets. Thus we obtain AHL-net transformation systems as an instantiation of HLR-systems to AHL-nets. This allows us to build up AHL-nets from basic components and to transform the net structure using rules or productions in the sense of graph grammars. This concept is illustrated by extending the well-known example of \u2018dining philosophers\u2019. We are able to show that AHL-net-transformation systems satisfy several important compatibility properties. On the one hand we obtain a local Church-Rosser and Parallelism Theorem, which is well-known for graph grammars and has recently been generalized to HLR-systems. This allows us to analyse concurrency in AHL-nets not only on the token level but also on the level of transformations of the net structure. On the other hand, we consider the \u2018fusion\u2019 and \u2018union\u2019 constructions for high-level structures, motivated by corresponding concepts for high-level Petri nets in the literature, and we show compatibility of these constructions with derivations of HLR-systems in general and AHL-nettransformations in particular. This means compatibility of vertical and horizontal structuring in terms of software development.<\/jats:p>","DOI":"10.1017\/s0960129500000724","type":"journal-article","created":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T09:00:54Z","timestamp":1236157254000},"page":"217-256","source":"Crossref","is-referenced-by-count":58,"title":["Algebraic high-level net transformation systems"],"prefix":"10.1017","volume":"5","author":[{"given":"Julia","family":"Padberg","sequence":"first","affiliation":[]},{"given":"Hartmut","family":"Ehrig","sequence":"additional","affiliation":[]},{"given":"Leila","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2009,3,4]]},"reference":[{"key":"S0960129500000724_ref044","unstructured":"Vautherin J. (1986) Parallel systems specifications with coloured Petri nets and algebraic abstract data types. In: 7th European Workshop on Applications and Theory of Petri Nets (Oxford, England), 5\u201323"},{"key":"S0960129500000724_ref043","unstructured":"Tarlecki A. , Burstall R. M. and Goguen J. A. (1987) Some fundamental algebraic tools for the semantics of computation. Part III: Indexed categories, Techn. Report, University of Edinburgh."},{"key":"S0960129500000724_ref041","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09262-9"},{"key":"S0960129500000724_ref038","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9"},{"key":"S0960129500000724_ref034","unstructured":"Padberg J. (1992) Theory of High-Level-Replacement Systems and its Applications to Petri-Nets, Diploma thesis, TU Berlin, FB 20."},{"key":"S0960129500000724_ref033","first-page":"105","article-title":"Petri nets are monoids","volume":"2","author":"Meseguer","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"S0960129500000724_ref032","unstructured":"LOTOS (1987) Information processing systems - Open systems interconnection - LOTOS - A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, ISO DIS 8807 (ISO\/TC 97\/SC 21 N)."},{"key":"S0960129500000724_ref030","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-84524-6"},{"key":"S0960129500000724_ref028","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90049-9"},{"key":"S0960129500000724_ref027","unstructured":"Hummert U. (1989) Algebraische High-Level Netze, Ph.D. thesis, TU Berlin, Dept. of Comp. Sci."},{"key":"S0960129500000724_ref026","unstructured":"Huber P. , Jensen K. and Shapiro R. M. (1991) Hierarquies in coloured Petri nets. In: Jensen and Rozenberg (1991) 215\u2013243"},{"key":"S0960129500000724_ref025","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19630270108"},{"key":"S0960129500000724_ref022","doi-asserted-by":"crossref","unstructured":"Ehrig H. , Parisi-Presicce F. , Boehm P. , Rickhoff C. , Dimitrovici C. and Gro\u00dfe-Rhode M. (1987) Algebraic Data Type and Process Specifications based on Projection Spaces. Springer-Verlag Lecture Notes in Computer Science 332 23\u201313 (Techn. Report No. 87\u201308, TU Berlin, FB 20, 1987.)","DOI":"10.1007\/3-540-50325-0_2"},{"key":"S0960129500000724_ref021","doi-asserted-by":"crossref","unstructured":"Ehrig H. and Parisi-Presicce F. (1991b) Nonequivalence of Categories for Equational Algebraic Specifications in View of High-Level Replacement Systems, Techn. Report 91\/16, TU Berlin, Dept. of Comp. Sci. (Short version in Proc. 3rd Conf. on Algebraic and Logic Programming, Pisa, 1992.)","DOI":"10.1007\/BFb0013816"},{"key":"S0960129500000724_ref020","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017396"},{"key":"S0960129500000724_ref031","unstructured":"Kramer B. and Schmidt H. W. (1991) Types and Modules for Net Specifications. In: Jensen and Rozenberg (1991) 171\u2013188"},{"key":"#cr-split#-S0960129500000724_ref019.1","doi-asserted-by":"crossref","unstructured":"Ehrig H. , Padberg J. and Ribeiro L. (1993) Algebraic High-Level nets: Petri nets revisited, Proc. Of the ADT-COMPASS Workshop '92 (Caldes de Malavella, Spain)","DOI":"10.1007\/3-540-57867-6_11"},{"key":"#cr-split#-S0960129500000724_ref019.2","unstructured":"Techn. Report No. 93-6, TU Berlin, FB 20, 1993. (Short version to appear in Springer-Verlag Lecture Notes in Computer Science.)"},{"key":"S0960129500000724_ref018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69962-7"},{"key":"S0960129500000724_ref012","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56379-2_41"},{"key":"S0960129500000724_ref040","doi-asserted-by":"crossref","unstructured":"Ribeiro L. , Ehrig H. and Padberg J. (1993) Formal Development of Concurrent Systems Using Algebraic High-Level Nets and Transformations, Techn. Report No. 93\u201312, TU Berlin, FB 20. (Short version in Proc 8 Simpz\u00f3sio Brasileiro de Engenheria de Software, Rio de Janeiro, 1993, 1\u201316)","DOI":"10.5753\/sbes.1993.24392"},{"key":"S0960129500000724_ref005","first-page":"89","volume-title":"Algebra of Communicating Processes","author":"Bergstra","year":"1986"},{"key":"S0960129500000724_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10007-5_41"},{"key":"S0960129500000724_ref013","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-19422-3_1"},{"key":"S0960129500000724_ref037","unstructured":"Petri C. A. (1962) Kommunikation mit Automaten, Ph.D. thesis, Schriften des Instituts f\u00fcr Instrumentelle Mathematik, Bonn."},{"key":"S0960129500000724_ref042","unstructured":"Taentzer G. (1992) Parallel High-Level Replacement Systems, Technical Report No. 92\u201310, TU Berlin, FB 20."},{"key":"S0960129500000724_ref029","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06289-0"},{"key":"S0960129500000724_ref014","unstructured":"Ehrig H. , Gro\u00dfe-Rhode M. and Heise A. (1992) Specification Techniques for Concurrent and Distributed Systems, Invited lecture for 2nd Maghrebian Conference on Software Engineering and Artificial Intelligence, Tunis 1992, Techn. Report No. 92\u201305, TU Berlin, FB 20."},{"key":"S0960129500000724_ref017","unstructured":"Ehrig H. , Kreowski H.-J. and Taentzer G. (1992) Canonical Derivations in High-Level-Replacement Systems, Technical Report 6\/92, University of Bremen."},{"key":"S0960129500000724_ref016","first-page":"361","article-title":"Parallelism and Concurrency in High-Level-Replacement Systems","volume":"1","author":"Ehrig","year":"1991","journal-title":"MSCS"},{"key":"S0960129500000724_ref039","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90203-E"},{"key":"S0960129500000724_ref010","volume-title":"Hierarchical ordering of sequential processes, Operating systems techniques","author":"Dijkstra","year":"1971"},{"key":"S0960129500000724_ref023","unstructured":"Ehrig H. , Pfender M. and Schneider H. J. (1993) Graph Grammars: An Algebraic Approach, Proc. IEEE Conf. SWATT \u201873, Iowa City, 167\u2013180"},{"key":"S0960129500000724_ref024","volume-title":"Algebraic theory of processes","author":"Hennessy","year":"1988"},{"key":"S0960129500000724_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0025714"},{"key":"S0960129500000724_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-15198-2_2"},{"key":"S0960129500000724_ref035","unstructured":"Padberg J. and Taentzer G. (1993) Embedding of Derivations in High-Level Replacement Systems, Techn. Report No. 93\u201309, TU Berlin, FB 20."},{"key":"S0960129500000724_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-50580-6_22"},{"key":"S0960129500000724_ref036","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90042-Z"},{"key":"S0960129500000724_ref015","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90110-4"},{"key":"S0960129500000724_ref001","volume-title":"Abstract and Concrete Categories","author":"Adameck","year":"1990"},{"key":"S0960129500000724_ref002","first-page":"81","article-title":"An outline of the SMolCS approach","volume":"380","author":"Astesiano","year":"1982","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"S0960129500000724_ref007","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55610-9_168"},{"key":"S0960129500000724_ref008","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54496-8_4"},{"key":"S0960129500000724_ref009","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019971"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129500000724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T01:44:43Z","timestamp":1710121483000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129500000724\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["S0960129500000724"],"URL":"https:\/\/doi.org\/10.1017\/s0960129500000724","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}