The covering and boundedness problems for vector addition systems

Cites work

Bounds on Positive Integral Solutions of Linear Diophantine Equations
scientific article; zbMATH DE number 3582425 (Why is no real title available?)
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)

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

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)