LTL Path Checking Is Efficiently Parallelizable
From MaRDI portal
Publication:3638098
DOI10.1007/978-3-642-02930-1_20zbMath1248.68252OpenAlexW1524646280MaRDI QIDQ3638098
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_20
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items
Team semantics for the specification and verification of hyperproperties, The complexity of counting models of linear-time temporal logic, A survey of challenges for runtime verification from advanced application domains (beyond software), Unnamed Item, Weak Kripke Structures and LTL