scientific article; zbMATH DE number 7376061
From MaRDI portal
Publication:5002821
DOI10.4230/LIPIcs.ICALP.2018.134zbMath1499.68229MaRDI QIDQ5002821
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
formal verificationlinear algebrareachability probleminfinite-state systemKosaraju-Sullivan algorithmvector additions system with states
Analysis of algorithms and problem complexity (68Q25) 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 (4)
The polynomial complexity of vector addition systems with states ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Long-Run Average Behavior of Vector Addition Systems with States ⋮ Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
Cites Work
- On the reachability problem for 5-dimensional vector addition systems
- A structure to decide reachability in Petri nets
- The covering and boundedness problems for vector addition systems
- An Algorithm for the General Petri Net Reachability Problem
- The Complexity of the Finite Containment Problem for Petri Nets
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Demystifying Reachability in Vector Addition Systems
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings
- Minimal solutions of linear diophantine systems : bounds and algorithms
- Unnamed Item
- Unnamed Item
This page was built for publication:
