Formal relationship between graph grammars and Petri nets

DOI10.1007/3-540-61228-9_94zbMath1412.68108OpenAlexW1538310288MaRDI QIDQ4645283

Leila Ribeiro, Martin Korff

Publication date: 10 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61228-9_94

zbMATH Keywords

graph grammargraph transformationattribution functionderivation stepsequential derivation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Cites Work

• On categorical graph grammars integrating structural transformations and operations on labels
• Algebraic approach to single-pushout graph transformation
• Petri nets and algebraic specifications
• Petri nets are monoids
• System modelling with high-level Petri nets
• Algebraic high-level net transformation systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formal relationship between graph grammars and Petri nets