Model Checking Data Flows in Concurrent Network Updates

Finkbeiner, Bernd; Gieseking, Manuel; Hecking-Harbusch, Jesko; Olderog, Ernst-Rüdiger

doi:10.1007/978-3-030-31784-3_30

Cited by 14 publications

(18 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The separation of data and control plane and updates to the routing configuration can be encoded into Petri nets with transits [9]. Using this encoding, we demonstrate the workflow of the web interface for model checking an asynchronous distributed system with data flows.…”

Section: Web Interface For Petri Nets With Transitsmentioning

confidence: 99%

“…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.…”

Section: Web Interface For Petri Nets With Transitsmentioning

confidence: 99%

“…Tokens represent components and transitions with more than one token correspond to synchronizations between the components. Petri nets with transits [9] extend Petri nets with a transit relation to model the data flow in asynchronous This work has been supported by the German Research Foundation (DFG) through Grant Petri Games (392735815) and through the Collaborative Research Center "Foundations of Perspicuous Software Systems" (TRR 248, 389792660), and by the European Research Council (ERC) through Grant OSARES (683300). 1 The web interface is deployed at http://adam.informatik.uni-oldenburg.de.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Web Interface for Petri Nets with Transits and Petri Games

Gieseking

Hecking-Harbusch

Yanich

2021

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Developing algorithms for distributed systems is an error-prone task. Formal models like Petri nets with transits and Petri games can prevent errors when developing such algorithms. Petri nets with transits allow us to follow the data flow between components in a distributed system. They can be model checked against specifications in LTL on both the local data flow and the global behavior. Petri games allow the synthesis of local controllers for distributed systems from safety specifications. Modeling problems in these formalisms requires defining extended Petri nets which can be cumbersome when performed textually.In this paper, we present a web interface (The web interface is deployed at http://adam.informatik.uni-oldenburg.de.) that allows an intuitive, visual definition of Petri nets with transits and Petri games. The corresponding model checking and synthesis problems are solved directly on a server. In the interface, implementations, counterexamples, and all intermediate steps can be analyzed and simulated. Stepwise simulations and interactive state space generation support the user in detecting modeling errors.

show abstract

Section: Web Interface For Petri Nets With Transitsmentioning

confidence: 99%

Section: Web Interface For Petri Nets With Transitsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Web Interface for Petri Nets with Transits and Petri Games

Gieseking

Hecking-Harbusch

Yanich

2021

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…The construction of the circuit in Aiger format [3] is defined in [11]. MCHyper [15] is used to create a circuit from a given circuit and an LTL formula.…”

Section: Application Areasmentioning

confidence: 99%

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

Finkbeiner

Gieseking

Hecking-Harbusch

et al. 2020

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…Tokens represent components and transitions with more than one token correspond to synchronizations between the components. Petri nets with transits [9] extend Petri nets with a transit relation to model the data flow in asynchronous distributed systems. Flow-LTL [9] is a specification language for Petri nets with transits and allows us to specify linear properties on both the global and the local view of the system.…”

Section: Introductionmentioning

confidence: 99%

A Web Interface for Petri Nets with Transits and Petri Games

Gieseking¹,

Hecking-Harbusch²,

Yanich³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Developing algorithms for distributed systems is an errorprone task. Formal models like Petri nets with transits and Petri games can prevent errors when developing such algorithms. Petri nets with transits allow us to follow the data flow between components in a distributed system. They can be model checked against specifications in LTL on both the local data flow and the global behavior. Petri games allow the synthesis of local controllers for distributed systems from safety specifications. Modeling problems in these formalisms requires defining extended Petri nets which can be cumbersome when performed textually. In this paper, we present a web interface 1 that allows an intuitive, visual definition of Petri nets with transits and Petri games. The corresponding model checking and synthesis problems are solved directly on a server. In the interface, implementations, counterexamples, and all intermediate steps can be analyzed and simulated. Stepwise simulations and interactive state space generation support the user in detecting modeling errors. ‡ This is the authors' copy of [17].

show abstract

Model Checking Data Flows in Concurrent Network Updates

Cited by 14 publications

References 36 publications

A Web Interface for Petri Nets with Transits and Petri Games

A Web Interface for Petri Nets with Transits and Petri Games

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

A Web Interface for Petri Nets with Transits and Petri Games

Contact Info

Product

Resources

About