Some fundamental algebraic tools for the semantics of computation, part 3: indexed categories
Theoretical Computer Science
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
High-level nets with nets and rules as tokens
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Categorical foundations of distributed graph transformation
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Transformations in Reconfigurable Place/Transition Systems
Concurrency, Graphs and Models
| Hi-index | 0.00 |
Adhesive high-level replacement (HLR) systems have been recently established as a suitable categorical framework for double pushout transformations based on weak adhesive HLR categories. Among different types of graphs and graph-like structures, various kinds of Petri nets and algebraic high-level (AHL) nets are interesting instantiations of adhesive HLR systems. AHL nets combine algebraic specifications with Petri nets to allow the modeling of data, data flow and data changes within the net. For the development and analysis of reconfigurable systems, not only AHL schemas based on an algebraic specification and AHL nets using an additional algebra should be considered, but also AHL systems which additionally include markings of nets. In this paper, we summarize the results for different kinds of AHL schemas and nets, and extend these results to AHL systems. The category of markings is introduced, which allows a general construction combining AHL nets with possible markings leading under certain properties to a weak adhesive HLR category.