Symbolic model checking of public announcement protocols

DOI10.1093/logcom/exz023zbMath1446.68090OpenAlexW2995400951WikidataQ127320912 ScholiaQ127320912MaRDI QIDQ5216337

Tristan Charrier, François Schwarzentruber, Sophie Pinchinat

Publication date: 17 February 2020

Published in: Journal of Logic and Computation (Search for Journal in Brave)

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

zbMATH Keywords

model checkingepistemic logicarbitrary public announcementssymbolic models

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Exploiting Asymmetry in Logic Puzzles: Using ZDDs for Symbolic Model Checking Dynamic Epistemic Logic ⋮ A computationally grounded logic of graded belief

This page was built for publication: Symbolic model checking of public announcement protocols