Lower bounds for the reachability problem in fixed dimensional VASSes

DOI10.1145/3531130.3533357MaRDI QIDQ6649473

Lukasz Orlikowski, Wojciech Czerwiński

Publication date: 6 December 2024

zbMATH Keywords

Petri netslower boundsreachability problemvector addition systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Directed reachability for infinite-state systems
• Complexity hierarchies beyond elementary
• Reachability in Succinct and Parametric One-Counter Automata
• Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
• Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
• The Reachability Problem for Petri Nets Is Not Elementary
• The Reachability Problem for Two-Dimensional Vector Addition Systems with States
• The reachability problem for Petri nets is not elementary
• CONCUR 2004 - Concurrency Theory
• Counter machines and counter languages

This page was built for publication: Lower bounds for the reachability problem in fixed dimensional VASSes

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