Citation Context

... deliberative (‘intentions’) aspects of a rational agent. Such pioneering work on model checking techniques for the verification of agent-based systems has appeared, for example, in [22], [23], [24], =-=[25]-=- III. AGENT INFRASTRUCTURE LAYER Previous approaches to model checking agent-based systems have mostly been specific to one particular programming language (e.g., [24]), while in practice there is a w...

Citation Context

...an alternative proof of the upper bounds for model checking CTL in concurrent programs, which can be easily extended to CTLK. 3. APPLICATIONS 3.1 The complexity of model checking MCMAS programs MCMAS =-=[11]-=- is a symbolic model checker for interpreted systems. Interpreted systems [5] provide a semantics for temporal and epistemic operators, based on a system of agents. Each agent is characterised by a se...

Citation Context

...ional logics such as epistemic and deontic logics in combination with temporal logic. To accommodate for these needs several techniques for model checking have been suitably extended. For instance in =-=[4,20]-=- OBDD-based techniques for temporal epistemic logic were introduced. Similar analysis were carried out previously for SAT-based approaches, including bounded and unbounded model checking [18,10]. Thes...

Citation Context

...rational agent. Such pioneering work on model checking techniques for the verification of agent-based systems often based on standard model checkers such as Spin or JPF, has appeared, for example, in =-=[1; 2; 7]-=-. 2 Architecture of the AIL One of the problems with existing approaches to model checking agent programs is that one had to find ways of encoding beliefs, goals, etc., within the state of the JPF or ...

Citation Context

...ice that quantification brings in justified? While these objections are certainly sensible, we believe their strength has been increasingly weakened by recent progress in the area of MAS verification =-=[8, 12, 13]-=- by model checking. In the model checking approach [1] we do not check whether a formula representing a specification is satisfiable in some model based on the completeness class, but simply whether a...

Citation Context

... are also supported. MCMAS-SLK, released as open-source, implements novel labelling algorithms for SL, encoded on BDDs, and reuses existing algorithms for the verification of epistemic specifications =-=[29]-=-. 2 Epistemic Strategy Logic Underlying Framework. Differently from other treatments of SL, originally defined on concurrent game structures, we here define the logic on interpreted systems [14]. Doin...

Citation Context

...lating the verification of temporal-epistemic into plain temporal logic [27]. Following this there were studies on the extension of bounded model checking algorithms [53] and binary-decision diagrams =-=[57]-=-. Several other extensions and algorithms later appeared. The aim of this paper is to summarise some of the early results obtained by the authors in this area. The area has grown tremendously in recen...

Citation Context

...ns [35]. 5 The NuSMV2 model checker is open source and can be downloaded from: http://nusmv.fbk.eu/NuSMV/download/getting-v2.html2.2 Developing New Algorithms and Tools To model MASs, the authors in =-=[37,38]-=- use the formalism of interpreted systems [22]. This formalism is defined as follows. Assume a set of agents ...

Citation Context

...ues for multi-agent systems, there are already some notable achievements: [2] focuses on model-checking AgentSpeak systems, [3] proposes Temporal Trace Language for analyzing dynamics between agents, =-=[14]-=- refers to verifying deontic interpreted systems. However, we are not aware of existing proof-methods for model-checking refinement between abstraction levels of agent-oriented specifications. As for ...