Model Checking Coverability Graphs of Vector Addition Systems

DOI10.1007/978-3-642-22993-0_13zbMath1343.68152OpenAlexW1799125424MaRDI QIDQ3088033

Sylvain Schmitz, Michel Blockelet

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_13

zbMATH Keywords

complexityCTLvector addition systemscoverability properties

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

Forward analysis and model checking for trace bounded WSTS ⋮ On selective unboundedness of VASS ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Strategic reasoning with a bounded number of resources: the quest for tractability ⋮ Forward Analysis and Model Checking for Trace Bounded WSTS ⋮ The virtues of idleness: a decidable fragment of resource agent logic ⋮ On the complexity of resource-bounded logics ⋮ Coverability Trees for Petri Nets with Unordered Data ⋮ Complexity Hierarchies beyond Elementary

This page was built for publication: Model Checking Coverability Graphs of Vector Addition Systems