Automatic synthesis of transiently correct network updates via Petri games

DOI10.1007/978-3-030-76983-3_7zbMath1489.68157OpenAlexW3166300667MaRDI QIDQ2117163

Sangey D. L. Lama, Martin Didriksen, Shahab Shajarat, Jonathan F. Jønler, Jiří Srba, Frederik B. Lottrup, Andrei-Ioan Katona, Peter Gjøl Jensen

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-76983-3_7

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Kaki: concurrent update synthesis for regular policies via Petri games ⋮ Elimination of detached regions in dependency graph verification

Uses Software

• Unnamed Item
• NuSMV
• AdamMC
• zUpdate
• PTrie

Cites Work

• Unnamed Item
• PTrie: data structure for compressing and storing sets via prefix sharing
• \textsc{AdamMC}: a model checker for Petri nets with transits against Flow-LTL
• Scheduling Loop-free Network Updates
• Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
• TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets
• Model Checking Data Flows in Concurrent Network Updates
• Congestion-Free Rerouting of Flows on DAGs

This page was built for publication: Automatic synthesis of transiently correct network updates via Petri games