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

Abstract

The correctness of networks is often described in terms of the individual data flow of components instead of their global behavior. In software-defined networks, it is far more convenient to specify the correct behavior of packets than the global behavior of the entire network. Petri nets with transits extend Petri nets and Flow-LTL extends LTL such that the data flows of tokens can be tracked. We present the tool AdamMC as the first model checker for Petri nets with transits against Flow-LTL. We describe how AdamMC can automatically encode concurrent updates of software-defined networks as Petri nets with transits and how common network specifications can be expressed in Flow-LTL. Underlying AdamMC is a reduction to a circuit model checking problem. We introduce a new reduction method that results in tremendous performance improvements compared to a previous prototype. Thereby, AdamMC can handle software-defined networks with up to 82 switches.

A Web Interface for Petri Nets with Transits and Petri Games

“…Features for Petri Nets with Transits. AdamMC [10] is a command-line model checking tool for Petri nets with transits and Flow-LTL [9]. The model checking problem of Petri nets with transits against Flow-LTL is solved by a reduction to Petri nets and LTL.…”

“…In particular, it is possible to globally select desired runs of the system with LTL (e.g., only fair and maximal runs) and check the local data flow of only those runs again with LTL. A model checker for Petri nets with transits against Flow-LTL is implemented in the tool AdamMC [10].…”

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

“…Consequently, all parameters are selectable by the user and a script is provided to compare different settings. An overview of the selectable optimization parameters can be found in the documentation of AdamMC [12]. Our main improvement claims can be retraced by the case study in Sec.…”

“…Thereby, AdamMC can handle software-defined networks with up to 82 switches. ‡ This is the full version of [13].…”

Transition-Oriented Programming: Developing Verifiable Systems

“…Typical methods of formal verification include model checking and theorem proving. There have been lots of useful tools that implement these methods such as SPIN [10], NuSMV [3], JKIND [8], and AdamMC [7] for model checking, or Coq [18], Isabelle [14] for theorem proving.…”