Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata

2011 ◽  
Vol 112 (1) ◽  
pp. 19-37 ◽  
Author(s):  
Francesco Belardinelli ◽  
Andrew V. Jones ◽  
Alessio Lomuscio
Keyword(s):  
Model Checking ◽  
Epistemic Logic ◽  
Tree Automata ◽  
Alternating Tree Automata

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.

Church's Problem Revisited

1999 ◽  
Vol 5 (2) ◽  
pp. 245-263 ◽  
Author(s):  
Orna Kupferman ◽  
Moshe Y. Vardi
Keyword(s):  
Incomplete Information ◽  
Program Synthesis ◽  
Synthesis Problem ◽  
Tree Automata ◽  
Full Generality ◽  
Input Signals ◽  
Alternating Tree Automata ◽  
History Of ◽  
Underlying Processes

AbstractIn program synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system is open, then at each moment it reads input signals and writes output signals, which depend on the input signals and the history of the computation so far. The specification considers all possible input sequences. Thus, if the specification is linear, it should hold in every computation generated by the interaction, and if the specification is branching, it should hold in the tree that embodies all possible input sequences.Often, the system cannot read all the input signals generated by its environment. For example, in a distributed setting, it might be that each process can read input signals of only part of the underlying processes. Then, we should transform a specification into a system whose output depends only on the readable parts of the input signals and the history of the computation. This is called synthesis with incomplete information. In this work we solve the problem of synthesis with incomplete information in its full generality. We consider linear and branching settings with complete and incomplete information. We claim that alternation is a suitable and helpful mechanism for coping with incomplete information. Using alternating tree automata, we show that incomplete information does not make the synthesis problem more complex, in both the linear and the branching paradigm. In particular, we prove that independently of the presence of incomplete information, the synthesis problems for CTL and CTL*. are complete for EXPTIME and 2EXPTIME, respectively.

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.

Sign in / Sign up

Export Citation Format

Share Document