Results 11 - 20
of
111
Model checking knowledge, strategies, and games in multi-agent systems
- In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS). ACM
"... Abstract. We present an OBDD-based methodology for verifying knowledge and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we investigate the interpretation of ATL and epistemic formulae in various classes of interpreted systems, we present model che ..."
Abstract
-
Cited by 23 (5 self)
- Add to MetaCart
Abstract. We present an OBDD-based methodology for verifying knowledge and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we investigate the interpretation of ATL and epistemic formulae in various classes of interpreted systems, we present model checking algorithms and their implementation, and report experimental results. 1
Model Checking Agent Dialogues
, 2004
"... In this paper we address the challenges associated with the verification of correctness of communication between agents in MultiAgent Systems. Our approach applies model-checking techniques to protocols which express interactions between a group of agents in the form of a dialogue. We define a l ..."
Abstract
-
Cited by 21 (0 self)
- Add to MetaCart
In this paper we address the challenges associated with the verification of correctness of communication between agents in MultiAgent Systems. Our approach applies model-checking techniques to protocols which express interactions between a group of agents in the form of a dialogue. We define a lightweight protocol language which can express a wide range of dialogue types, and we use the SPIN model checker to verify properties of this language. Our early results show this approach has a high success rate in the detection of failures in agent dialogues.
Model Checking Bidding Behaviors in Internet Concurrent Auctions
- International Journal of Computer Systems Science & Engineering (IJCSSE), July 2007
, 2007
"... Online auctions have become a quite popular and effective approach in the Internet-based e-Marketplace. In concurrent auctions, where multiple auctions for identical items are running simultaneously, users ’ bidding behaviors become very complicated. This situation motivates shilling behaviors, in w ..."
Abstract
-
Cited by 17 (12 self)
- Add to MetaCart
(Show Context)
Online auctions have become a quite popular and effective approach in the Internet-based e-Marketplace. In concurrent auctions, where multiple auctions for identical items are running simultaneously, users ’ bidding behaviors become very complicated. This situation motivates shilling behaviors, in which a seller disguises himself as normal bidders in order to drive up the bidding price and make the winning bidder pay more for an auctioned item. The goal of this paper is to propose a formal approach to verifying bidding behaviors, and especially, detecting shilling behaviors in concurrent online auctions. We develop a model template for concurrent auctions and derive auction models based on auction data from two concurrent auctions. The auction model can be formally verified using the SPIN model checker for certain behavioral properties, which are specified in pattern-based LTL (Linear Temporal Logic) formulas. To illustrate the feasibility and effectiveness of our approach, we provide a case study to show how possible shill bidders can be detected.
Automatic verification of knowledge and time with NuSMV
- In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence
, 2007
"... We show that the problem of model checking multidimensional modal logics can be reduced to the problem of model checking ARCTL, an extension of the temporal logic CTL with action labels and operators to reason about actions. In particular, we introduce a methodology for model checking a temporal-epi ..."
Abstract
-
Cited by 15 (4 self)
- Add to MetaCart
We show that the problem of model checking multidimensional modal logics can be reduced to the problem of model checking ARCTL, an extension of the temporal logic CTL with action labels and operators to reason about actions. In particular, we introduce a methodology for model checking a temporal-epistemic logic by building upon an extension of the model checker NuSMV that enables the verification of ARCTL. We briefly present the implementation and report experimental results for the verification of a typical security protocol involving temporal-epistemic properties: the protocol of the dining cryptographers. 1
Verifiable Multi-Agent Programs
"... AgentSpeak is a reactive planning language for programming autonomous agents. It has recently been shown that model checking techniques can be applied to the veri cation of AgentSpeak systems, through a translation to promela, the model speci cation language for the SPIN LTL modelchecking system. ..."
Abstract
-
Cited by 14 (5 self)
- Add to MetaCart
AgentSpeak is a reactive planning language for programming autonomous agents. It has recently been shown that model checking techniques can be applied to the veri cation of AgentSpeak systems, through a translation to promela, the model speci cation language for the SPIN LTL modelchecking system. In this paper, we introduce an alternative veri cation approach for AgentSpeak, by translating AgentSpeak to Java and then applying JPF2, a general purpose Java model checker. The primary advantage of this approach is that Java is the language of choice for most agent implementations, and the approach is thus much closer to the current practice of agent development than the promela-based approach. We examine both alternatives by means of a practical application, provide a qualitative comparison between them, and identify some key issues for future research.
Models of interaction as a grounding for peer to peer knowledge sharing
- In Advances in Web Semantics
, 1993
"... Abstract. Most current attempts to achieve reliable knowledge sharing on a large scale have relied on pre-engineering of content and supply services. This, like traditional knowledge engineering, does not by itself scale to large, open, peer to peer systems because the cost of being precise about th ..."
Abstract
-
Cited by 14 (10 self)
- Add to MetaCart
(Show Context)
Abstract. Most current attempts to achieve reliable knowledge sharing on a large scale have relied on pre-engineering of content and supply services. This, like traditional knowledge engineering, does not by itself scale to large, open, peer to peer systems because the cost of being precise about the absolute semantics of services and their knowledge rises rapidly as more services participate. We describe how to break out of this deadlock by focusing on semantics related to interaction and using this to avoid dependency on a priori semantic agreement; instead making semantic commitments incrementally at run time. Our method is based on interaction models that are mobile in the sense that they may be transferred to other components, this being a mechanism for service composition and for coalition formation. By shifting the emphasis to interaction (the details of which may be hidden from users) we can obtain knowledge sharing of sufficient quality for sustainable communities of practice without the barrier of complex meta-data provision prior to community formation. 1
A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic
"... We introduce a symmetry reduction technique for model checking temporal-epistemic properties of multi-agent systems defined in the mainstream interpreted systems framework. The technique, based on counterpart semantics, aims to reduce the set of initial states that need to be considered in a model. ..."
Abstract
-
Cited by 14 (7 self)
- Add to MetaCart
We introduce a symmetry reduction technique for model checking temporal-epistemic properties of multi-agent systems defined in the mainstream interpreted systems framework. The technique, based on counterpart semantics, aims to reduce the set of initial states that need to be considered in a model. We present theoretical results establishing that there are neither false positives nor false negatives in the reduced model. We evaluate the technique by presenting the results of an implementation tested against two well known applications of epistemic logic, the muddy children and the dining cryptographers. The experimental results obtained confirm that the reduction in model checking time can be dramatic, thereby allowing for the verification of hitherto intractable systems. 1
Automatic Verification of Deontic Interpreted Systems by Model Checking via OBDD's
, 2004
"... We present an algorithm for the verification of multiagent systems specified by means of a modal logic that includes a temporal, an epistemic, and a deontic operator. Verification is performed by model checking on OBDD's. We present an implementation of the algorithm and report on experimental ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
We present an algorithm for the verification of multiagent systems specified by means of a modal logic that includes a temporal, an epistemic, and a deontic operator. Verification is performed by model checking on OBDD's. We present an implementation of the algorithm and report on experimental results for the bit transmission problem with faults.
Modeling and verification of distributed autonomous agents using logic programming
- In PreProceedings of the Workshop on Declarative Agent Languages and Technologies (DALT’04
, 2004
"... Abstract. Systems of autonomous agents providing automated services over the Web are fast becoming a reality. Often these agent systems are constructed using procedural architectures that provide a framework for connecting agent components that perform specific tasks. The agent designer codes the ta ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
(Show Context)
Abstract. Systems of autonomous agents providing automated services over the Web are fast becoming a reality. Often these agent systems are constructed using procedural architectures that provide a framework for connecting agent components that perform specific tasks. The agent designer codes the tasks necessary to perform a service and uses the framework to connect the tasks into an integrated agent structure. This bottom up approach does not provide an easy mechanism for confirming global properties of constructed agent systems. In this paper we propose a declarative methodology based on logic programming for modeling such procedurally constructed agents and specifying their global properties as temporal logic formulas. This methodology allows us to bring to bear a body of work for using logic programming based model checking to verify certain global properties of procedurally constructed Multi-Agent Systems. 1
