The covering and boundedness problems for vector addition systems

Cites work

scientific article; zbMATH DE number 3582425 (Why is no real title available?)
Bounds on Positive Integral Solutions of Linear Diophantine Equations
Parallel program schemata
Relationships between nondeterministic and deterministic tape complexities
The Complexity of the Finite Containment Problem for Petri Nets
The equality problem for vector addition systems is undecidable

Cited in

(only showing first 100 items - show all)

Linear time analysis of properties of conflict-free and general Petri nets
Global and local views of state fairness
A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
Polynomial vector addition systems with states
Robustness Against Transactional Causal Consistency.
Fast termination and workflow nets
ON YEN'S PATH LOGIC FOR PETRI NETS
Communicating processes, scheduling, and the complexity of nontermination
On termination and invariance for faulty channel machines
Verification of Immediate Observation Population Protocols
A unified approach for deciding the existence of certain petri net paths
The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
Deciding fast termination for probabilistic VASS with nondeterminism
Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
Coverability, termination, and finiteness in recursive Petri nets
Fixed-dimensional energy games are in pseudo-polynomial time
Process calculi as a tool for studying coordination, contracts and session types
Multiset rewriting for the verification of depth-bounded processes with name binding
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
Enforcing opacity by insertion functions under multiple energy constraints
scientific article; zbMATH DE number 7559503 (Why is no real title available?)
Large flocks of small birds: on the minimal size of population protocols
K-diagnosability analysis of bounded and unbounded Petri nets using linear optimization
A multiparameter analysis of the boundedness problem for vector addition systems
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic
Unbounded product-form Petri nets
Graph transformation for incremental natural language analysis
The reachability problem for branching vector addition systems requires doubly-exponential space
Verification of membrane systems with delays via Petri nets with delays
Deciding Structural Liveness of Petri Nets
The ideal view on Rackoff's coverability technique
Coverability and Termination in Recursive Petri Nets
On the complexity of resource-bounded logics
Long-Run Average Behavior of Vector Addition Systems with States
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Reachability solution characterization of parametric real-time systems
Protocols with constant local storage and unreliable communication
Forward analysis and model checking for trace bounded WSTS
scientific article; zbMATH DE number 7204383 (Why is no real title available?)
Extensional Petri net
A counter abstraction technique for verifying properties of probabilistic swarm systems
Checking robustness between weak transactional consistency models
Directed reachability for infinite-state systems
On two-way weak counter machines
On detectability of labeled Petri nets and finite automata
Coverability trees for Petri nets with unordered data
EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system
Forward analysis and model checking for trace bounded WSTS
Polynomial time coverability analysis in discrete state chemical reaction network subclasses
Boundedness, empty channel detection, and synchronization for communicating finite automata
Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
On the coverability problem for pushdown vector addition systems in one dimension
Bounded self-stabilizing Petri nets
The complexity of reversal-bounded model-checking
Affine extensions of integer vector addition systems with states
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Context-free commutative grammars with integer counters and resets
Reasoning about reversal-bounded counter machines
On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems
Ratio and weight quantiles
Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups.
Complexity of certain decision problems about congruential languages
The polynomial complexity of vector addition systems with states
Parameterized verification of coverability in infinite state broadcast networks
Logics of repeating values on data trees and branching counter systems
The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
On the decidability of fragments of the asynchronous \(\pi\)-calculus
Complexity of modal logics with Presburger constraints
Concurrency, Synchronization, and Conflicts in Petri Nets
On Yen’s Path Logic for Petri Nets
On minimal elements of upward-closed sets
Universality Problem for Unambiguous VASS
Quasi-static scheduling of communicating tasks
Waiting Nets: State Classes and Taxonomy
Normal and sinkless Petri nets
scientific article; zbMATH DE number 7407773 (Why is no real title available?)
A taxonomy of fairness and temporal logic problems for Petri nets
Parameterized Complexity Results for 1-safe Petri Nets
Aeolus: a component model for the cloud
Some complexity results for stateful network verification
Waiting nets
Untanglings: a novel approach to analyzing concurrent systems
Petri nets and regular languages
Verifying chemical reaction network implementations: a bisimulation approach
The complexity of reachability in distributed communicating processes
Verifying chemical reaction network implementations: a bisimulation approach
Unbounded-thread program verification using thread-state equations
PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
Combining free choice and time in Petri nets
An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
Optimal supervisory control with mean payoff objectives and under partial observation
Strategic reasoning with a bounded number of resources: the quest for tractability
The complexity of problems involving structurally bounded and conservative Petri nets
Vector Addition System Reversible Reachability Problem
Coverability in 2-VASS with one unary counter is in NP
The complexity of soundness in workflow nets
When is containment decidable for probabilistic automata?
On the finite containment problem for Petri nets
Coupling asynchrony and interrupts: Place Chart Nets

This page was built for publication: The covering and boundedness problems for vector addition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242682)