scholarly journals Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic (Extended Abstract)

2016 ◽  
Vol 215 ◽  
pp. 264-282
Author(s):  
R van der Meyden ◽  
M K Patra
Keyword(s):  
Model Checking ◽  
Epistemic Logic

scholarly journals Model Checking Temporal Epistemic Logic under Bounded Recall

2020 ◽  
Vol 34 (05) ◽  
pp. 7071-7078
Author(s):  
Francesco Belardinelli ◽  
Alessio Lomuscio ◽  
Emily Yu
Keyword(s):  
Model Checking ◽  
Incomplete Information ◽  
Epistemic Logic ◽  
Upper Bounds ◽  
Experimental Results ◽  
Model Checker ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Bounded Recall

We study the problem of verifying multi-agent systems under the assumption of bounded recall. We introduce the logic CTLKBR, a bounded-recall variant of the temporal-epistemic logic CTLK. We define and study the model checking problem against CTLK specifications under incomplete information and bounded recall and present complexity upper bounds. We present an extension of the BDD-based model checker MCMAS implementing model checking under bounded recall semantics and discuss the experimental results obtained.

scholarly journals Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*

2017 ◽  
Vol 28 (2) ◽  
pp. 367-402 ◽  
Author(s):  
Johan van Benthem ◽  
Jan van Eijck ◽  
Malvin Gattinger ◽  
Kaile Su
Keyword(s):  
Model Checking ◽  
Epistemic Logic ◽  
Dynamic Epistemic Logic ◽  
Symbolic Model Checking ◽  
Symbolic Model

scholarly journals Model Checking Probabilistic Epistemic Logic for Probabilistic Multiagent Systems

2018 ◽  
Author(s):  
Chen Fu ◽  
Andrea Turrini ◽  
Xiaowei Huang ◽  
Lei Song ◽  
Yuan Feng ◽  
...  
Keyword(s):  
Linear Programming ◽  
Model Checking ◽  
Multiagent Systems ◽  
Epistemic Logic ◽  
Mixed Integer ◽  
Model Checker ◽  
Non Linear Programming ◽  
Smt Solver ◽  
Realistic Assumption ◽  
Novel Algorithm

In this work we study the model checking problem for probabilistic multiagent systems with respect to the probabilistic epistemic logic PETL, which can specify both temporal and epistemic properties. We show that under the realistic assumption of uniform schedulers, i.e., the choice of every agent depends only on its observation history, PETL model checking is undecidable. By restricting the class of schedulers to be memoryless schedulers, we show that the problem becomes decidable. More importantly, we design a novel algorithm which reduces the model checking problem into a mixed integer non-linear programming problem, which can then be solved by using an SMT solver. The algorithm has been implemented in an existing model checker and experiments are conducted on examples from the IPPC competitions.

scholarly journals Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic

2020 ◽  
Vol 21 (4) ◽  
pp. 1-26
Author(s):  
Ron Van Der Meyden ◽  
Manas K. Patra
Keyword(s):  
Model Checking ◽  
Epistemic Logic

scholarly journals On the Epistemic Logic of Incomplete Argumentation Frameworks

2021 ◽  
Author(s):  
Andreas Herzig ◽  
Antonio Yuste-Ginel
Keyword(s):  
Model Checking ◽  
Equivalence Class ◽  
Epistemic Logic ◽  
Possible Worlds

We study the relation between two existing formalisms: incomplete argumentation frameworks (IAFs) and epistemic logic of visibility (ELV). We show that the set of completions of a given IAF naturally corresponds to a specific equivalence class of possible worlds within the model of visibility. This connection is further strengthened in two directions. First, we show how to reduce argument acceptance problems of IAFs to ELV model-checking problems. Second, we highlight the epistemic assumptions that underlie IAFs by providing a minimal epistemic logic for IAFs.

A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic

Synthese ◽  
2004 ◽  
Vol 142 (2) ◽  
pp. 203-227 ◽  
Author(s):  
M. Kacprzak ◽  
W. Penczek
Keyword(s):  
Model Checking ◽  
Epistemic Logic
Sign in / Sign up

Export Citation Format

Share Document