Unboundedness Problems for Languages of Vector Addition Systems.

DOI10.4230/LIPIcs.ICALP.2018.119zbMath1499.68170arXiv1802.06683OpenAlexW2963150833MaRDI QIDQ5002804

Georg Zetzsche, Wojciech Czerwiński, Piotr Hofman

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1802.06683

zbMATH Keywords

separabilitydecision problemsunboundednessvector addition systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Unboundedness problems for machines with reversal-bounded counters ⋮ Reachability problems in low-dimensional nondeterministic polynomial maps over integers

Uses Software

• MAGIC
• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forward analysis and model checking for trace bounded WSTS
• Bounded underapproximations
• A unified approach for deciding the existence of certain petri net paths
• A structure to decide reachability in Petri nets
• Remarks on blind and partially blind one-way multicounter machines
• Petri net algorithms in the theory of matrix grammars
• Concatenation hierarchies: new bottle, old wine
• Well-structured languages
• The emptiness problem for valence automata over graph monoids
• Regular Cost Functions, Part I: Logic and Algebra over Words
• Model-checking CTL* over flat Presburger counter systems
• A Perfect Model for Bounded Verification
• ON YEN'S PATH LOGIC FOR PETRI NETS
• Model Checking Coverability Graphs of Vector Addition Systems
• On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
• An Approach to Computing Downward Closures
• FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME
• The Downward-Closure of Petri Net Languages
• Deciding Piecewise Testable Separability for Regular Tree Languages
• It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton
• Separability of Reachability Sets of Vector Addition Systems
• Reachability in Petri Nets with Inhibitor Arcs
• Complexity of pattern-based verification for multithreaded programs
• Bounded Algol-Like Languages
• Bounded Regular Sets
• A Characterization of Semilinear Sets
• On free monoids partially ordered by embedding
• A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
• Ordering by Divisibility in Abstract Algebras
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Unboundedness Problems for Languages of Vector Addition Systems.