scientific article; zbMATH DE number 7649936

DOI10.4230/LIPIcs.CONCUR.2019.28MaRDI QIDQ5875390

Filip Mazowiecki, Michał Pilipczuk

Publication date: 3 February 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

counter machinesreachability problembranching VASSbobrvass

Mathematics Subject Classification ID

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

Related Items (1)

Strategic reasoning with a bounded number of resources: the quest for tractability

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum and maximum delay problems in real-time systems
• Deterministic one-counter automata
• A theory of timed automata
• Reachability in two-clock timed automata is PSPACE-complete
• Reachability in Register Machines with Polynomial Updates
• Analysis of recursively parallel programs
• Reachability in Succinct and Parametric One-Counter Automata
• Two-variable logic on data trees and XML reasoning
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• An Algorithm for the General Petri Net Reachability Problem
• A polynomial-time algorithm for reachability in branching VASS in dimension one
• Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
• Demystifying Reachability in Vector Addition Systems
• Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
• On the Relationship between Reachability Problems in Timed and Counter Automata
• Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One

This page was built for publication: