Computing parameterized invariants of parameterized Petri nets
From MaRDI portal
Publication:2117165
DOI10.1007/978-3-030-76983-3_8zbMath1489.68158arXiv2103.10280OpenAlexW3173420582MaRDI QIDQ2117165
Christoph Welzel, Mikhail Raskin, Javier Esparza
Publication date: 21 March 2022
Full work available at URL: https://arxiv.org/abs/2103.10280
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)
Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Computing parameterized invariants of parameterized Petri nets
Uses Software
Cites Work
- 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
- Free Choice Petri Nets
- 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)
- Applying CEGAR to the Petri Net State Equation
- Occam's razor applied to the Petri net coverability problem
- Well-structured transition systems everywhere!
- Symbolic model checking with rich assertional languages
- Checking deadlock-freedom of parametric component-based systems
This page was built for publication: Computing parameterized invariants of parameterized Petri nets
