research
∙
07/11/2023
Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard
Arbitrary Public Announcement Logic with Common Knowledge (APALC) is an ...
share
research
∙
07/11/2023
Simple Axioms for Local Properties
Correspondence theory allows us to create sound and complete axiomatizat...
research
∙
03/29/2023
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder
Temporal logics for the specification of information-flow properties are...
research
∙
05/10/2021
HyperLTL Satisfiability is Σ_1^1-complete, HyperCTL* Satisfiability is Σ_1^2-complete
Temporal logics for the specification of information-flow properties are...
research
∙
07/29/2019
Strengthening Gossip Protocols using Protocol-Dependent Knowledge
Distributed dynamic gossip is a generalization of the classic telephone ...
research
∙
02/03/2018
