Fine-grained complexity of safety verification

DOI10.1007/978-3-319-89963-3_2zbMath1423.68094arXiv1802.05559OpenAlexW2964160499MaRDI QIDQ5919616

Prakash Saivasan, Peter Chini, Roland Meyer

Publication date: 16 September 2019

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Liveness in broadcast networks ⋮ Bounded Context Switching for Valence Systems ⋮ Fine-grained complexity of safety verification

This page was built for publication: Fine-grained complexity of safety verification