Compositional verification of reactive systems specified by graph transformation

Concurrency and loose semantics of open graph transformation systems

Mathematical Structures in Computer Science ◽

10.1017/s0960129501003553 ◽

2002 ◽

Vol 12 (4) ◽

pp. 349-376 ◽

Cited By ~ 5

Author(s):

REIKO HECKEL ◽

MERCÉ LLABRÉS ◽

HARTMUT EHRIG ◽

FERNANDO OREJAS

Keyword(s):

Information Systems ◽

Local Church ◽

Formal Model ◽

Graph Transformation ◽

Reactive Systems ◽

Distributed Information Systems ◽

Distributed Information ◽

Shift Equivalence ◽

Transformation Systems ◽

Graph Transformation Systems

Graph transitions represent an extension of the DPO approach to graph transformation for the specification of reactive systems. In this paper, we develop the theory of concurrency for graph transitions. In particular, we prove a local Church–Rosser theorem and define a notion of shift-equivalence that allows us to represent both intra-concurrency (within the specified subsystem) and inter-concurrency (between subsystem and environment). Via an implementation of transitions in terms of DPO transformations with context rules, a second, more restrictive notion of equivalence is defined that captures, in addition, the extra-concurrency (between operations of the environment). As a running example and motivation, we show how the concepts of this paper provide a formal model for distributed information systems.

Download Full-text

Towards Compositional Verification of Synchronous Reactive Systems

International Journal of Critical Computer-Based Systems ◽

10.1504/ijccbs.2021.10040408 ◽

2021 ◽

Vol 10 (2) ◽

pp. 1

Author(s):

Mohamed Mezghiche ◽

Rabéa Ameur Boulifa ◽

Sarah Chabane

Keyword(s):

Reactive Systems ◽

Compositional Verification

Download Full-text

Towards compositional verification of synchronous reactive systems

International Journal of Critical Computer-Based Systems ◽

10.1504/ijccbs.2021.117995 ◽

2021 ◽

Vol 10 (2) ◽

pp. 120

Author(s):

Sarah Chabane ◽

Rabéa Ameur Boulifa ◽

Mezghiche Mohamed

Keyword(s):

Reactive Systems ◽

Compositional Verification

Download Full-text

Encoding Bigraphical Reactive Systems into Graph Transformation Systems

Electronic Notes in Discrete Mathematics ◽

10.1016/j.endm.2016.10.051 ◽

2016 ◽

Vol 55 ◽

pp. 207-210 ◽

Cited By ~ 3

Author(s):

Amal Gassara ◽

Ismael Bouassida Rodriguez ◽

Mohamed Jmaiel ◽

Kalil Drira

Keyword(s):

Graph Transformation ◽

Reactive Systems ◽

Transformation Systems ◽

Graph Transformation Systems

Download Full-text

A tale of two graph models: a case study in wireless sensor networks

Formal Aspects of Computing ◽

10.1007/s00165-021-00558-z ◽

2021 ◽

Author(s):

Blair Archibald ◽

Géza Kulcsár ◽

Michele Sevegnani

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Topology Control ◽

Graph Transformation ◽

Reactive Systems ◽

Control Flow ◽

Wireless Sensor ◽

Mapping Techniques ◽

Design Reasoning ◽

Graph Transformation Systems

AbstractDesigning and reasoning about complex systems such as wireless sensor networks is hard due to highly dynamic environments: sensors are heterogeneous, battery-powered, and mobile. While formal modelling can provide rigorous mechanisms for design/reasoning, they are often viewed as difficult to use. Graph rewrite-based modelling techniques increase usability by providing an intuitive, flexible, and diagrammatic form of modelling in which graph-like structures express relationships between entities while rewriting mechanisms allow model evolution. Two major graph-based formalisms are Graph Transformation Systems (GTS) and Bigraphical Reactive Systems (BRS). While both use similar underlying structures, how they are employed in modelling is quite different. To gain a deeper understanding of GTS and BRS, and to guide future modelling, theory, and tool development, in this experience report we compare the practical modelling abilities and style of GTS and BRS when applied to topology control in WSNs. To show the value of the models, we describe how analysis may be performed in both formalisms. A comparison of the approaches shows that although the two formalisms are different, from both a theoretical and practical modelling standpoint, they are each successful in modelling topology control in WSNs. We found that GTS, while featuring a small set of entities and transformation rules, relied on entity attributes, rule application based on attribute/variable side-conditions, and imperative control flow units. BRS on the other hand, required a larger number of entities in order to both encode attributes directly in the model (via nesting) and provide tagging functionality that, when coupled with rule priorities, implements control flow. There remains promising research mapping techniques between the formalisms to further enable flexible and expressive modelling.

Download Full-text