Computing Parameterized Invariants of Parameterized Petri Nets

DOI10.3233/FI-222137OpenAlexW3137833661MaRDI QIDQ5044400

Christoph Welzel, Javier Esparza, Mikhail Raskin

Publication date: 31 October 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-222137

zbMATH Keywords

theorem provinglogicWS1Sfirst-orderparameterized systems

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• D-Finder
• VAMPIRE
• MONA
• Potassco
• CVC4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning about networks with many identical finite state processes
• Computing parameterized invariants of parameterized Petri nets
• Minimal coverability tree construction made complete and efficient
• Checking qualitative liveness properties of replicated systems with stochastic scheduling
• Approaching the coverability problem continuously
• On the computation of the minimal coverability set of Petri nets
• Tight Cutoffs for Guarded Protocols with Fairness
• Unbounded-Thread Program Verification using Thread-State Equations
• An SMT-Based Approach to Coverability Analysis
• Model Checking Parameterized Systems
• Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity
• Reasoning about systems with many processes
• Decidability of Parameterized Verification
• Understanding Petri Nets
• Structural Invariants for the Verification of Systems with Parameterized Architectures
• CONCUR 2004 - Concurrency Theory
• Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
• Occam's razor applied to the Petri net coverability problem
• Well-structured transition systems everywhere!
• Symbolic model checking with rich assertional languages

This page was built for publication: Computing Parameterized Invariants of Parameterized Petri Nets