Verifying epistemic properties of multi-agent systems via bounded model checking

Penczek, Wojciech; Lomuscio, Alessio

doi:10.1145/860575.860609

Cited by 66 publications

(76 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, the authors show how commitment-based protocols, specified in CTLC, can be checked by resorting to existing model-checking engines. Specifically, CTLC can be reduced to CTLK [56], an epistemic logic on branching time whose calculus has been implemented in the MCMAS model checker [57]. In a nutshell, the CTLC syntax is as follows:…”

Section: Verifying Adoptmentioning

confidence: 99%

Computational Accountability in MAS Organizations with ADOPT

et al. 2018

View full text Add to dashboard Cite

Abstract:This work studies how the notion of accountability can play a key role in the design and realization of distributed systems that are open and that involve autonomous agents that should harmonize their own goals with the organizational goals. The socio-technical systems that support the work inside human companies and organizations are examples of such systems. The approach that is proposed in order to pursue this purpose is set in the context of multiagent systems organizations, and relies on an explicit specification of relationships among the involved agents for capturing who is accountable to whom and for what. Such accountability relationships are created along with the agents' operations and interactions in a shared environment. In order to guarantee accountability as a design property of the system, a specific interaction protocol is suggested. Properties of this protocol are verified, and a case study is provided consisting of an actual implementation. Finally, we discuss the impact on real-world application domains and trace possible evolutions of the proposal.

show abstract

Section: Verifying Adoptmentioning

confidence: 99%

Computational Accountability in MAS Organizations with ADOPT

et al. 2018

View full text Add to dashboard Cite

show abstract

“…The epistemic operator K i is a S5 modality [10], which means knowledge is reflexive and Euclidean [12]. K i φ represents "agent i knows that φ".…”

Section: Syntax Of P Ct Lkmentioning

confidence: 99%

“…Due to existing quantitative properties, the computing result of probabilities is also needed in some cases. In fact, our P CT LK language can be seen as a variant of CT LK [12] by replacing the path quantifiers ∃ and ∀ by the probabilistic operator P r. The MCMAS [11] model checker can be used to verify the properties expressed with CT LK. P CT LK provides possibility b for path formulas to specify the likelihood of the path.…”

Section: Sat-based Model Checkingmentioning

confidence: 99%

Model Checking Epistemic and Probabilistic Properties of Multi-agent Systems

Wang¹,

Hamza²

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Model checking, a formal automatic verification method, has been widely used in multi-agent systems to verify specifications that contain qualitative properties (e.g safety and liveliness) and quantitative properties. Decision making processes based on inherent knowledge are necessary for agents to act appropriately, particularly in uncertain settings. In order to check epistemic (i.e knowledge) and measurable properties in multi-agent systems, we propose a new logic P CT LK, which uses probabilistic, epistemic, and temporal modal operators. We exploit Discrete-Time Markov Chains (DTMC), in which we are able to represent measurable properties with probability, to model uncertainty in multi-agent systems. We extend the formalism of interpreted systems by adding probabilistic features to suit DTMC models and to present the model checking algorithm for our logic. At the end of this paper, we simulate our algorithm using an example of online shopping.

show abstract

“…In [14,10] an extension of the method of bounded model checking (one of the main SAT-based techniques) to CTLK a language comprising both CTL and knowledge operators, was defined, implemented, and evaluated. While preliminary results appear largely positive, any bounded model checking algorithm is mostly of use when the task is either to check whether a universal CTLK formula is actually false on a model, or to check that an existential CTLK formula is valid.…”

Section: 1mentioning

confidence: 99%

Verifying Multi-agent Systems via Unbounded Model Checking

Kacprzak

Lomuscio

Łasica

et al. 2004

Formal Approaches to Agent-Based Systems

Self Cite

View full text Add to dashboard Cite

Abstract. We present an approach to the problem of verification of epistemic properties in multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend the technique of unbounded model checking from a purely temporal setting to a temporalepistemic one. In order to achieve this, we base our discussion on interpreted systems semantics, a popular semantics used in multi-agent systems literature. We give details of the technique and show how it can be applied to the well known train, gate and controller problem.

show abstract

Verifying epistemic properties of multi-agent systems via bounded model checking

Cited by 66 publications

References 30 publications

Computational Accountability in MAS Organizations with ADOPT

Computational Accountability in MAS Organizations with ADOPT

Model Checking Epistemic and Probabilistic Properties of Multi-agent Systems

Verifying Multi-agent Systems via Unbounded Model Checking

Contact Info

Product

Resources

About