Encoding Incremental NACs in Safe Graph Grammars using Complementation
Andrea Corradini (Dipartimento di Informatica, University of Pisa,, Italy), Maryam Ghaffari Saadat (Department of Informatics, University of, Leicester, UK), Reiko Heckel (Department of Informatics, University of, Leicester, UK)
TL;DR
This paper presents a method to encode negative application conditions in graph grammars using complementation, simplifying behavioral analysis while ensuring correctness under certain safety and incrementality assumptions.
Contribution
It introduces a novel encoding technique for NACs in graph grammars via complementation, addressing complexity in behavioral analysis.
Findings
Encoding is correct for safe, incremental NACs
Extension to unsafe, attributed grammars is outlined
Simplifies analysis of complex graph systems
Abstract
In modelling complex systems with graph grammars (GGs), it is convenient to restrict the application of rules using attribute constraints and negative application conditions (NACs). However, having both attributes and NACs in GGs renders the behavioural analysis (e.g. unfolding) of such systems more complicated. We address this issue by an approach to encode NACs using a complementation technique. We consider the correctness of our encoding under the assumption that the grammar is safe and NACs are incremental, and outline how this result can be extended to unsafe, attributed grammars.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.