Distributed breadth-first search LTL model checking

DOI10.1007/s10703-006-0009-yzbMath1102.68503OpenAlexW2000162135MaRDI QIDQ2431772

Ivana Černá, Jiří Barnat

Publication date: 24 October 2006

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-006-0009-y

zbMATH Keywords

Breadth-first searchDistributed memoryLTL model checking

Mathematics Subject Classification ID

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

Related Items

Automated Verification of Parallel Nested DFS

Uses Software

• SPIN
• DiVinE

Cites Work

• Automata-theoretic techniques for modal logics of programs
• The temporal semantics of concurrent programs
• Mathematical Foundations of Computer Science 2003
• Formal Methods in Computer-Aided Design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item