Verification and strategy synthesis for coalition announcement logic

DOI10.1007/s10849-021-09339-6zbMath1496.03066OpenAlexW3182023080MaRDI QIDQ2071573

Yanyan Li

Publication date: 28 January 2022

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-021-09339-6

zbMATH Keywords

model checkingdynamic epistemic logiccoalition announcement logicgroup announcement logic

Mathematics Subject Classification ID

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

Related Items (1)

Logics with group announcements and distributed knowledge: completeness and expressive power

Uses Software

• MCMAS
• MCK
• SMCDEL
• DEMO

Cites Work

• The undecidability of quantified announcements
• What will they say? -- Public announcement games
• The secret of my success
• Group announcement logic
• The Russian cards problem
• Resolving distributed knowledge
• Positive announcements
• Logics of public communications
• On the definability of simulation and bisimulation in epistemic logic
• ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
• Three Partition Refinement Algorithms
• A Modal Logic for Coalitional Power in Games
• Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verification and strategy synthesis for coalition announcement logic