High-Level Representation of Benchmark Families for Petri Games

TL;DR

This paper introduces a high-level representation method for benchmark families in Petri games, facilitating the synthesis of distributed controllers and enabling efficient evaluation of synthesis tools.

Contribution

It proposes a novel high-level Petri net approach to represent entire benchmark families, improving the efficiency and flexibility of distributed synthesis evaluation.

Findings

High-level Petri nets can represent entire benchmark families.

The approach enables parameterized instantiation of Petri games.

Improvements in size and functionality of benchmark families were demonstrated.

Abstract

Petri games have been introduced as a multi-player game model representing causal memory to address the synthesis of distributed systems. For Petri games with one environment player and an arbitrary bounded number of system players, deciding the existence of a safety strategy is EXPTIME-complete. This result forms the basis of the tool ADAM that implements an algorithm for the synthesis of distributed controllers from Petri games. To evaluate the tool, it has been checked on a series of parameterized benchmarks from manufacturing and workflow scenarios. In this paper, we introduce a new possibility to represent benchmark families for the distributed synthesis problem modeled with Petri games. It enables the user to specify an entire benchmark family as one parameterized high-level net. We describe example benchmark families as a high-level version of a Petri game and exhibit an instantiation yielding a concrete 1-bounded Petri game. We identify improvements either regarding the size or the functionality of the benchmark families by examining the high-level Petri games.