A structural approach to graph transformation based on symmetric Petri nets

DOI10.1016/j.jlamp.2021.100639OpenAlexW3119341763MaRDI QIDQ2035652

Lorenzo Capra

Publication date: 25 June 2021

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2434/847492

zbMATH Keywords

operational semanticsstructural analysisgraph transformation systemssymmetric netsdouble pushout

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic graphs for attributed graph constraints
• Algebraic approach to single-pushout graph transformation
• A symbolic reachability graph for coloured Petri nets
• Overview of reconfigurable Petri nets
• Fundamentals of algebraic graph transformation
• Labelled Graph Rewriting Meets Social Networks
• Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
• Towards the Verification of Attributed Graph Transformation Systems
• Handbook of Graph Grammars and Computing by Graph Transformation
• Handbook of Graph Grammars and Computing by Graph Transformation
• Lectures on Concurrency and Petri Nets
• Applications and Theory of Petri Nets 2005
• Concurrent graph and term graph rewriting

This page was built for publication: A structural approach to graph transformation based on symmetric Petri nets