The polynomial complexity of vector addition systems with states

DOI10.1007/978-3-030-45231-5_32zbMath1442.68154arXiv1907.01076OpenAlexW3022740807MaRDI QIDQ2200853

Florian Zuleger

Publication date: 23 September 2020

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ The polynomial complexity of vector addition systems with states ⋮ Type-based analysis of logarithmic amortised complexity

Cites Work

• Unnamed Item
• Unnamed Item
• On the reachability problem for 5-dimensional vector addition systems
• The covering and boundedness problems for vector addition systems
• The polynomial complexity of vector addition systems with states
• Complexity and resource bound analysis of imperative programs using difference constraints
• On the \(\omega\)-language expressive power of extended Petri nets
• Parallel program schemata
• Liveness of Parameterized Timed Networks
• On the Expressive Power of Communication Primitives in Parameterised Systems
• A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
• Reasoning about systems with many processes
• Decidability of Parameterized Verification
• Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
• Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms

This page was built for publication: The polynomial complexity of vector addition systems with states