Complexity Analysis of the Backward Coverability Algorithm for VASS

DOI10.1007/978-3-642-24288-5_10zbMath1348.68159OpenAlexW263470693MaRDI QIDQ3172868

Pierre Ganty, Laura Bozzelli

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24288-5_10

zbMATH Keywords

vector addition system with states

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 (6)

Ratio and Weight Quantiles ⋮ Unnamed Item ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Data flow analysis of asynchronous systems using infinite abstract domains ⋮ Verification of Immediate Observation Population Protocols ⋮ The ideal view on Rackoff's coverability technique

This page was built for publication: Complexity Analysis of the Backward Coverability Algorithm for VASS