Encoding Incremental NACs in Safe Graph Grammars using Complementation

12/03/2020
by   Andrea Corradini, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/19/2018

Attributed Hierarchical Port Graphs and Applications

We present attributed hierarchical port graphs (AHP) as an extension of ...
07/22/2018

Generating an ATL Model Checker using an Attribute Grammar

In this paper we present the attribute grammars as a formal approach for...
05/28/2014

Conformant Planning as a Case Study of Incremental QBF Solving

We consider planning with uncertainty in the initial state as a case stu...
04/13/2017

Incremental Skip-gram Model with Negative Sampling

This paper explores an incremental training strategy for the skip-gram m...
06/02/2019

Incremental Few-Shot Learning for Pedestrian Attribute Recognition

Pedestrian attribute recognition has received increasing attention due t...
05/27/2018

Contextual Graph Markov Model: A Deep and Generative Approach to Graph Processing

We introduce the Contextual Graph Markov Model, an approach combining id...
12/03/2020

Modeling Adverse Conditions in the Framework of Graph Transformation Systems

The concept of adverse conditions addresses systems interacting with an ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.