scholarly journals Verification and Strategy Synthesis for Coalition Announcement Logic

2021 ◽  
Author(s):  
Natasha Alechina ◽  
Hans van Ditmarsch ◽  
Rustam Galimullin ◽  
Tuo Wang
Keyword(s):  
Model Checking ◽  
Proof Of Concept ◽  
Model Checker ◽  
Complete Model ◽  
Concept Model ◽  
The Family ◽  
Winning Strategies ◽  
Epistemic Goals

AbstractCoalition announcement logic (CAL) is one of the family of the logics of quantified announcements. It allows us to reason about what a coalition of agents can achieve by making announcements in the setting where the anti-coalition may have an announcement of their own to preclude the former from reaching its epistemic goals. In this paper, we describe a PSPACE-complete model checking algorithm for CAL that produces winning strategies for coalitions. The algorithm is implemented in a proof-of-concept model checker.

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.

Do the biological details matter?

1997 ◽  
Vol 20 (4) ◽  
pp. 684-685 ◽  
Author(s):  
James M. Bower
Keyword(s):  
Neuronal Activity ◽  
Visual Stimuli ◽  
Theoretical Work ◽  
Cortical Processing ◽  
Proof Of Concept ◽  
Processing Scheme ◽  
Concept Model ◽  
Cortical Oscillations ◽  
Target Article ◽  
Cell Firing

Phillips & Singer (P&S) extend ideas derived from the observation eight years ago that the coherence (synchronization) of cortical oscillations can be modulated by the structure of visual stimuli. As described in the target article, a large part of the continued interest in this finding is related to independent theoretical work suggesting that synchronized cell firing could help solve the problem of binding together within cortex neuronal activity associated with different attributes of visual stimuli. The authors present an abstract “proof of concept” model describing how their cortical processing scheme could work, but our biologically realistic models of cortical relationships suggest that the proposal is biologically implausible. Our realistic models lead to a very different interpretation of the significance of cortical oscillations.

Family-Based Model Checking Without a Family-Based Model Checker

2015 ◽  
pp. 282-299 ◽  
Author(s):  
Aleksandar S. Dimovski ◽  
Ahmad Salim Al-Sibahi ◽  
Claus Brabrand ◽  
Andrzej Wąsowski
Keyword(s):  
Model Checking ◽  
Model Checker ◽  
Family Based

scholarly journals Testing a proof of concept model for group couples counseling in family planning in Northern Uganda

2018 ◽  
Vol 30 ◽  
Author(s):  
Lillian Ojanduru ◽  
Dickens Ojamuge ◽  
Lauren DuComb ◽  
Jeannette Cachan ◽  
Esther Spindler
Keyword(s):  
Family Planning ◽  
Northern Uganda ◽  
Couples Counseling ◽  
Proof Of Concept ◽  
Concept Model

SUPPORTING FORMAL VERIFICATION OF DIMA MULTI-AGENTS MODELS: TOWARDS A FRAMEWORK BASED ON MAUDE MODEL CHECKING

2008 ◽  
Vol 18 (07) ◽  
pp. 853-875 ◽  
Author(s):  
NOURA BOUDIAF ◽  
FARID MOKHATI ◽  
MOURAD BADRI
Keyword(s):  
Model Checking ◽  
Development Process ◽  
Formal Semantics ◽  
Concurrent Systems ◽  
Model Checker ◽  
Rewriting Logic ◽  
Generic Framework ◽  
Systems Quality ◽  
Verification Techniques ◽  
Multi Agents

Model Checking based verification techniques represent an important issue in the field of concurrent systems quality assurance. The lack of formal semantics in the existing formalisms describing multi-agents models combined with multi-agents systems complexity are sources of several problems during their development process. The Maude language, based on rewriting logic, offers a rich notation supporting formal specification and implementation of concurrent systems. In addition to its modeling capacity, the Maude environment integrates a Model Checker based on Linear Temporal Logic (LTL) for distributed systems verification. In this paper, we present a formal and generic framework (DIMA-Maude) supporting formal description and verification of DIMA multi-agents models.

Efficient Bounded Model Checking for LTL

2013 ◽  
Vol 380-384 ◽  
pp. 1239-1242
Author(s):  
Rui Wang ◽  
Xian Jin Fu
Keyword(s):  
Model Checking ◽  
Efficient Method ◽  
Bounded Model Checking ◽  
Specification Languages ◽  
Model Checker ◽  
System Designs

Bounded Model Checking is an efficient method of finding bugs in system designs. LTL is one of the most frequently used specification languages in model checking. In this paper, We present an linearization encoding for LTL bounded model checking. We use the incremental SAT technology to solve the BMC problem. We implement the new encoding in NuSMV model checker.

Sign in / Sign up

Export Citation Format

Share Document