Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation

The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This translation depends on a concrete model and may yield large graph transformation systems as the number of rules depends directly on the number of transitions in the net. Hence, the aim of this paper is to define the behavior of Algebraic HighLevel nets, a high-level Petri net variant, by a parallel, typed, attributed graph transformation system. Such a general parallel transformation system for AHL nets replaces the translation of transitions of specific AHL nets. After reviewing the formal definitions of AHL nets and parallel attributed graph transformation, we formalize the classical translation from AHL nets to graph transformation systems and prove the correctness of the translation. The translation approach then is contrasted to a definition for AHL net behavior based on parallel graph transformation...

• Type: Conference
• Year: 2005
• Where: BIRTHDAY
• Authors: Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl
• Keywords: Ahl Net, Applied Computing, BIRTHDAY 2005, Graph Transformation, Graph Transformation Systems