3 files

AdamMC: A Model Checker for Petri Nets with Transits against Flow-LTL (Artifact)

This is an artifact prepared only for the replicability of the experimental results of the following paper submitted to CAV2020

Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch, and Ernst-Rüdiger Olderog
AdamMC: A Model Checker for Petri Nets with Transits against Flow-LTL

This project contains a VM (Ubuntu 18.04.3 LTS (Bionic Beaver) 64-bit) with
  • the input data to create Table 2,
  • bash scripts to create subsets of the presented data or the complete data set,
  • the tool, its sources, a user's guide, examples,
  • the external tools which are used by the prototype,
  • the corresponding paper, and
  • a README for this artifact.
This artifact is integrated into the provided virtual machine.

Please refer to the README for installation instruction, usage, and detailed information about the artifact.


This artifact uses the following tools

the following libraries

and is integrated into the ADAM framework.

Petri nets with transits allow us to follow the precise flow of tokens. For example, it is possible to exactly follow the flow of a packet in a software-defined network. Flow-LTL is a corresponding logic for Petri nets with transits and extends LTL. The logic has places and transitions as atomic propositions and allows to specify both global and local behavior. Run formulas for global behavior specify fairness and maximality assumptions, e.g., that the network always forwards packets eventually. Flow formulas for local behavior specify the flow of transits, e.g., that packets are routed loop free.

AdamMC provides three modules: First, the general model checking problem of Petri nets with transits against Flow-LTL is solved. Second, we provide specific input languages to input concurrent updates to software-defined networks and check whether they fulfill properties like connectivity, packet coherence, drop freedom, and loop freedom expressed in Flow-LTL. Third, the model checking problem of Petri nets against LTL with places and transitions as atomic propositions is solved.


Petri Games: A Semantic and Algorithmic Approach for the Efficient Synthesis of Distributed Reactive Systems

Deutsche Forschungsgemeinschaft

Find out more...


Usage metrics