Complexity Analysis of the Backward Coverability Algorithm for VASS
From MaRDI portal
Publication:3172868
DOI10.1007/978-3-642-24288-5_10zbMath1348.68159MaRDI QIDQ3172868
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
68Q25: Analysis of algorithms and problem complexity
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Verification of Immediate Observation Population Protocols, The ideal view on Rackoff's coverability technique, Data flow analysis of asynchronous systems using infinite abstract domains, Ratio and Weight Quantiles, Deciding Fast Termination for Probabilistic VASS with Nondeterminism