29 citations · 33 across the 2 of their papers we have counts for
2 papers
cs.LO2012★ 4 cited
Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics
Rodica Bozianu, Cătălin Dima, Constantin Enea
We show that the model-checking problem is decidable for a fragment of the epistemic μ-calculus. The fragment allows free variables within the scope of epistemic modalities in a re…
cs.LO2010★ 29 cited
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions
Cătălin Dima, Constantin Enea, Dimitar Guelev
We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial ob…