Model checking ontology‐driven reasoning agents using strategy and abstraction. (7th April 2019)

• Record Type: Journal Article
• Authors: Rakib, Abdur; Faruqui, Rokan Uddin
• Other Names: Ko Hoon guestEditor.; Marreiros Goreti guestEditor.; Cong Vinh Phan guestEditor.
• Is Part Of: Concurrency and computation. Volume 33:Number 2(2021)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-04-07
• Subjects: maude -- model checking -- multi‐agent systems -- ontology -- rewriting logic -- rule‐based reasoning; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5205
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: We present a framework for the modelling, specification, and verification of ontology‐driven multi‐agent rule‐based systems (MASs). We assume that each agent executes in a separate process and that they communicate via message passing. The proposed approach makes use of abstract specifications to model the behaviour of some of the agents in the system and exploits information about the reasoning strategy adopted by the agents. Abstract specifications are given as Linear Temporal Logic (LTL) formulas which describe the external behaviour of the agents, allowing their temporal behaviour to be compactly modelled. Both abstraction and strategy have been combined in an automated model checking encoding tool T ovrba for rule‐based multi‐agent systems which allows the system designer to specify information about agents' interaction, behaviour, and execution strategy at different levels of abstraction. The T ovrba tool generates an encoding of the system for the Maude LTL model checker, allowing properties of the system to be verified.