Decidability of model checking multi-agent systems against a class of EHS specifications
نویسندگان
چکیده
We define and illustrate the expressiveness of the AB̄L fragment of the Epistemic Halpern–Shoham Logic as a specification language for multi-agent systems. We consider the model checking problem for systems against specifications given in the logic. We show its decidability by means of a novel technique that may be reused in other contexts for showing decidability of other logics based on intervals.
منابع مشابه
Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions
We introduce EHS, a novel temporal-epistemic logic defined on temporal intervals characterised by regular expressions. We investigate the complexity of verifying multi-agent systems against EHS specifications for a number of fragments of EHS with results ranging from PSPACE-completeness to non-elementary time. The findings show that, at least for the fragments under analysis, the increase in ex...
متن کاملModel Checking Auctions as Artifact Systems: Decidability via Finite Abstraction
The formal verification of auctions has recently received considerable attention in the AI and logic community. We tackle this problem by adopting methodologies and techniques originally developed for Artifact Systems, a novel paradigm in Service Oriented Computing. Specifically, we introduce a typed version of artifactcentric multi-agent systems (AC-MAS), a multi-agent setting for Artifact Sys...
متن کاملSymbolic Model Checking Multi-Agent Systems against CTL*K Specifications
We introduce a technique for model checking multi-agent systems against temporal-epistemic specifications expressed in the logic CTL∗K. We present an algorithm for the verification of explicit models and use this to show that the problem is PSPACE-complete. We show that the technique is amenable to symbolic implementation via binary decision diagrams. We introduce MCMAS∗, a toolkit based on the...
متن کاملModel Checking Distributed Systems against Temporal-Epistemic Specifications
Concurrency and message reordering are two main causes for the state-explosion in distributed systems with asynchronous communication. We study this domain by analysing ABS, an executable modelling language for object-based distributed systems and present a symbolic model checking methodology for verifying ABS programs against temporal-epistemic specifications. Specifically, we show how to map ...
متن کاملVerification of Non-Uniform and Unbounded Artifact-Centric Systems: Decidability through Abstraction
The formal verification of Artifact-centric (AC) systems is a subject of growing interest in the Service Oriented Computing (SOC) community, which can benefit from techniques developed for Multiagent systems and knowledge reasoning and representation. In the present contribution we consider the verification of AC systems that do not necessarily satisfy boundedness and uniformity, the typical as...
متن کامل