Partial order reduction for checking LTL formulae with the next-time operator

DOI10.1093/LOGCOM/EXW004MaRDI QIDQ3133158zbMATHOpenAlexFDO

Authors Shuanglong Kan, Zhiqiu Huang, Zhe Chen, Weiwei Li, Yutao Huang

Publication date 13 February 2018

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exw004

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Transparent partial order reduction
• A partial order approach to branching time logic model checking.
• Publication:4507826
• Partial order reduction for state/event LTL with application to component-interaction automata
• Partial-Order Reduction

Cited in

(6)

• Partial Order Reduction for State/Event LTL
• Automata-driven partial order reduction and guided search for LTL model checking
• Partial-order reduction for parity games with an application on parameterised Boolean equation systems
• Exponential automatic amortized resource analysis
• scientific article; zbMATH DE number 1361136 (Why is no real title available?)
• Transparent partial order reduction

This page was built for publication: Partial order reduction for checking LTL formulae with the next-time operator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133158)