Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems

DOI10.1007/978-3-319-63390-9_9zbMath1495.68134MaRDI QIDQ2164219

Igor Walukiewicz, Marie Fortin, Anca Muscholl

Publication date: 12 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-319-63390-9_9

zbMATH Keywords

pushdown systems; contributor instances; linear-time properties; parameterized verification problem; universal reachability

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

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

03B44: Temporal logic

Related Items

On the Complexity of Bounded Context Switching., Fine-grained complexity of safety verification