Directed reachability for infinite-state systems
From MaRDI portal
Publication:2233488
DOI10.1007/978-3-030-72013-1_1zbMath1474.68202arXiv2010.07912OpenAlexW3145100375MaRDI QIDQ2233488
Michael Blondin, Philip Offtermatt, Christoph Haase
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2010.07912
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)
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking ⋮ Coverability in 2-VASS with one unary counter is in NP
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verification of population protocols
- A structure to decide reachability in Petri nets
- Some decision problems related to the reachability problem for Petri nets
- Complexity of some problems in Petri nets
- The covering and boundedness problems for vector addition systems
- Parameterized complexity and approximability of coverability problems in weighted Petri nets
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Continuous reachability for unordered data Petri nets is in PTime
- A Petri net approach to the study of persistence in chemical reaction networks
- Context-free commutative grammars with integer counters and resets
- Complexity Analysis of Continuous Petri Nets
- Unbounded-Thread Program Verification using Thread-State Equations
- An SMT-Based Approach to Coverability Analysis
- Survey on Directed Model Checking
- Reasoning about systems with many processes
- Demystifying Reachability in Vector Addition Systems
- The reachability problem for Petri nets is not elementary
- Structural Counter Abstraction
- The Logical View on Continuous Petri Nets
- Component-based synthesis for complex APIs
- Occam's razor applied to the Petri net coverability problem
This page was built for publication: Directed reachability for infinite-state systems
