Checking bisimilarity for attributed graph transformation

DOI10.1007/978-3-642-37075-5_8MaRDI QIDQ4910415zbMATH OpenOpenAlexFDO

Authors Fernando Orejas, Artur Boronat, Ulrike Golas, Nikos Mylonakis

Publication date 18 March 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-37075-5_8

zbMATH Keywords

attributed graph transformationbisimilarityborrowed contextssymbolic graph transformation

Mathematics Subject Classification ID

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

Recommendations

• Borrowed contexts for attributed graphs
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
• Foundations of Software Science and Computation Structures
• Towards the Verification of Attributed Graph Transformation Systems
• Formal verification of invariants for attributed graph transformation systems based on nested attributed graph conditions

Cited in

(1)

• Borrowed contexts for attributed graphs

This page was built for publication: Checking bisimilarity for attributed graph transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910415)