Results 1 
8 of
8
Verifying Epistemic Properties of Multiagent Systems via Bounded Model Checking
, 2003
"... We present a framework for verifying temporal and epistemic properties of multiagent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be applied to the "attacking generals problem ", a typ ..."
Abstract

Cited by 72 (40 self)
 Add to MetaCart
We present a framework for verifying temporal and epistemic properties of multiagent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be applied to the "attacking generals problem ", a typical example of coordination in multiagent systems.
A Computationally Grounded Logic of Visibility, Perception, and Knowledge
, 2001
"... VSK logic is a family of multimodal logics for reasoning about the information properties of computational agents situated in some environment. Using VSK logic, we can represent what is objectively true of the environment, the information that is visible,orknowable about the environment, informat ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
VSK logic is a family of multimodal logics for reasoning about the information properties of computational agents situated in some environment. Using VSK logic, we can represent what is objectively true of the environment, the information that is visible,orknowable about the environment, information the agent perceives of the environment, and finally, information the agent actually knows about the environment. The semantics of VSK logic are given in terms of a general, automatalike model of agents. In this paper, we prove completeness for an axiomatisation of VSK logic, and present correspondence results for a number of VSK interaction axioms in terms of the architectural properties of the agent that they represent. The completeness proof is novel in that we are able to prove completeness with respect to the automatalike semantics. In this sense, VSK logic is said to be computationally grounded. We give an example to illustrate the formalism, and present conclusions and issues for further work.
Towards Model Checking Interpreted Systems
 In Proc. of the 2nd NASA Workshop on Formal Approaches to AgentBased Systems (FAABS’02), volume 2699 of LNAI
, 2002
"... We show how it is possible to pair the NuSMV model checker with Akka, a software platform used to check validity of propositional modal formulas, to verify static properties of multiagent systems formalised on interpreted systems semantics. ..."
Abstract

Cited by 11 (9 self)
 Add to MetaCart
We show how it is possible to pair the NuSMV model checker with Akka, a software platform used to check validity of propositional modal formulas, to verify static properties of multiagent systems formalised on interpreted systems semantics.
On MultiAgent Systems Specification via Deontic Logic
 IN PROCEEDINGS OF ATAL 2001
, 2001
"... We investigate an extension of the formalism of interpreted systems by Halpern and colleagues to model correct behaviour of agents. The semantical model allows for the representation and reasoning about states of correct and incorrect functioning behaviour of the agents, and of the system as a wh ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We investigate an extension of the formalism of interpreted systems by Halpern and colleagues to model correct behaviour of agents. The semantical model allows for the representation and reasoning about states of correct and incorrect functioning behaviour of the agents, and of the system as a whole. We axiomatise this semantic class by mapping it into a suitable class of Kripke models. The resulting
A logic for knowledge, correctness, and real time
 IN PROC. OF CLIMA’04, LNAI
, 2005
"... We present TCTLKD, a logic for knowledge, correctness and real time. TCTLKD is interpreted on real time deontic interpreted systems, and extension to continuous time of deontic interpreted systems. We exemplify the use of TCTLKD by discussing a variant of the “railroad crossing system”. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We present TCTLKD, a logic for knowledge, correctness and real time. TCTLKD is interpreted on real time deontic interpreted systems, and extension to continuous time of deontic interpreted systems. We exemplify the use of TCTLKD by discussing a variant of the “railroad crossing system”.
Extending interpreting systems with some deontic concepts
 Proceedings of TARK 2001
, 2001
"... We investigate an extension of interpreted systems to model correct functioning behaviour of agents and of the system as a whole. We combine this notion with the standard epistemic notions defined on interpreted systems to provide a formalism to reason about knowledge that agents are permitted to ho ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We investigate an extension of interpreted systems to model correct functioning behaviour of agents and of the system as a whole. We combine this notion with the standard epistemic notions defined on interpreted systems to provide a formalism to reason about knowledge that agents are permitted to hold under ideal functioning circrn~tances. We then extend this by introducing a doublyindexed operator representing knowledge that an agent would have if it were operating under the assumption that a group of agents is functioning as intended. We investigate the completeness problem for the first formalism and discuss the issue for the more general one. 1
Investigations in Grounded Semantics for MultiAgent Systems Specification Via Deontic Logic
, 2000
"... ..."
Verified Synthesis of KnowledgeBased Programs in Finite Synchronous Environments
, 2013
"... Knowledgebased programs (KBPs) are a formalism for directly relating an agent’s knowledge and behaviour. Here we present a general scheme for compiling KBPs to executable automata with a proof of correctness in Isabelle/HOL. We develop the algorithm topdown, using Isabelle’s locale mechanism to st ..."
Abstract
 Add to MetaCart
Knowledgebased programs (KBPs) are a formalism for directly relating an agent’s knowledge and behaviour. Here we present a general scheme for compiling KBPs to executable automata with a proof of correctness in Isabelle/HOL. We develop the algorithm topdown, using Isabelle’s locale mechanism to structure these proofs, and show that two classic examples