DeepAI AI Chat
Log In Sign Up

Encoding Incremental NACs in Safe Graph Grammars using Complementation

by   Andrea Corradini, et al.

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.


page 1

page 2

page 3

page 4


Attributed Hierarchical Port Graphs and Applications

We present attributed hierarchical port graphs (AHP) as an extension of ...

Generating an ATL Model Checker using an Attribute Grammar

In this paper we present the attribute grammars as a formal approach for...

Conformant Planning as a Case Study of Incremental QBF Solving

We consider planning with uncertainty in the initial state as a case stu...

Incremental Skip-gram Model with Negative Sampling

This paper explores an incremental training strategy for the skip-gram m...

Epsilon-Safe Planning

We introduce an approach to high-level conditional planning we call epsi...

Incremental Few-Shot Learning for Pedestrian Attribute Recognition

Pedestrian attribute recognition has received increasing attention due t...

Dynamic Measurement of Structural Entropy for Dynamic Graphs

Structural entropy solves the problem of measuring the amount of informa...