Monus semantics in vector addition systems with states

DOI10.4230/LIPICS.CONCUR.2023.10MaRDI QIDQ6967339zbMATH OpenFDO

Authors Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche

Publication date 26 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2023.10

zbMATH Keywords

coverabilityoverapproximationreachabilityvector addition systems

Mathematics Subject Classification ID

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

Cites work

• A lower bound for the coverability problem in acyclic pushdown VAS
• A multiparameter analysis of the boundedness problem for vector addition systems
• A polynomial-time algorithm for reachability in branching VASS in dimension one
• An SMT-based approach to coverability analysis
• Approaching the coverability problem continuously
• Complexity analysis of continuous Petri nets
• Complexity of problems of commutative grammars
• Coverability in 2-VASS with one unary counter is in NP
• Deterministic one-counter automata
• Directed reachability for infinite-state systems
• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• scientific article; zbMATH DE number 7559493 (Why is no real title available?)
• scientific article; zbMATH DE number 7559494 (Why is no real title available?)
• scientific article; zbMATH DE number 7559504 (Why is no real title available?)
• Integer vector addition systems with states
• Lower bounds for the reachability problem in fixed dimensional VASSes
• On the coverability problem for pushdown vector addition systems in one dimension
• On the reachability problem for 5-dimensional vector addition systems
• Polynomial-space completeness of reachability for succinct branching VASS in dimension one
• Reachability in bidirected pushdown VASS
• Reachability in Succinct and Parametric One-Counter Automata
• Reachability in two-clock timed automata is PSPACE-complete
• Reachability in vector addition systems is Ackermann-complete
• Reachability in vector addition systems is primitive-recursive in fixed dimension
• Reasoning about systems with many processes
• Regular separability in Büchi VASS
• The complexity of decision problems for finite-turn multicounter machines
• The covering and boundedness problems for branching vector addition systems
• The covering and boundedness problems for vector addition systems
• The reachability problem for Petri nets is not primitive recursive
• The Reachability Problem for Two-Dimensional Vector Addition Systems with States
• Verification of workflow nets
• Well-structured transition systems everywhere!

This page was built for publication: Monus semantics in vector addition systems with states

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