Parallel Explicit Model Checking for Generalized Büchi Automata

DOI10.1007/978-3-662-46681-0_56zbMath1420.68137OpenAlexW2124698211MaRDI QIDQ5194963

Denis Poitrenaud, Alexandre Duret-Lutz, Fabrice Kordon, Etienne Renault

Publication date: 17 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://doi.org/10.1007/978-3-662-46681-0_56

zbMATH Keywords

model checkingprototype implementationgood speedupmultiple threadstrongly connect component

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

LTL to self-loop alternating automata with generic acceptance and back ⋮ Finding strongly connected components of simple digraphs based on granulation strategy

This page was built for publication: Parallel Explicit Model Checking for Generalized Büchi Automata