Reactive graphs in action (extended version)

TL;DR

The paper addresses modeling and analysis of reconfigurable systems where transitions update accessibility during execution, using reactive graphs $M=(W,Act,E)$ that maintain a current configuration $(w,\alpha)$ with $w\in W$ and $\alpha\subseteq E$. It introduces multi-action reactive graphs and formal activation/deactivation semantics, together with an intrusive product to model cross-system interference. It also presents Marge, a web-based, open-source visualization and analysis tool that animates the operator semantics, expands the encoded LTS, and supports deadlock detection, contradictory effects, and strong bisimulation checks. The results demonstrate that reactive graphs can compactly represent adaptive systems and software product lines, and the paper outlines future work on usability, fuzzy extensions, and integrating a model-checker.

Abstract

Reactive graphs are transition structures whereas edges become active and inactive during its evolution, that were introduced by Dov Gabbay from a mathematical's perspective. This paper presents Marge (https://fm-dcc.github.io/MARGe), a web-based tool to visualise and analyse reactive graphs enriched with labels. Marge animates the operational semantics of reactive graphs and offers different graphical views to provide insights over concrete systems. We motivate the applicability of reactive graphs for adaptive systems and for featured transition systems, using Marge to tighten the gap between the existing theoretical models and their usage to analyse concrete systems.

Figures (2)

• Figure 1: A reactive graph of a vending machine offering two different products
• Figure 2: The LTS of the vending machine in \ref{['fig:vd1']}

Theorems & Definitions (1)

• definition thmcounterdefinition: Reactive graph