Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic

DOI10.1007/978-3-642-20674-0_7zbMath1327.68159OpenAlexW2105461037MaRDI QIDQ3003427

Cheng Luo, Xiaowei Huang, Ron van der Meyden

Publication date: 27 May 2011

Published in: Model Checking and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20674-0_7

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Uses Software

• VerICS
• CUDD
• MCMAS
• MCK

Cites Work

• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Complete axiomatizations for reasoning about knowledge and branching time
• Logic and time
• The Byzantine Generals Problem
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic