CAN-Verify: Automated analysis for BDI agents

We present CAN-Verify , an automated tool for analysing BDI agents written in the Conceptual Agent Notation ( Can ) language. CAN-Verify includes support for syntactic error detection before agent execution, agent program interpretation (running agents), and model-checking of agent programs (analysing agents). The model checking supports verifying the correctness of agents against both generic agent requirements, such as if a task is accomplished, and user-defined requirements, such as certain beliefs eventually holding. The latter can be expressed in structured natural language, allowing the tool to be used by agent programmers without formal training in the underlying verification techniques.

Authors

Institutions

Publication Details

Journal
Science of Computer Programming
Published
2024-11-15
DOI
https://doi.org/10.1016/j.scico.2024.103233
Primary Topic
Multi-Agent Systems and Negotiation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CAN-Verify: Automated analysis for BDI agents

Blair Archibald, Michele Sevegnani, Mengwei Xu
Science of Computer Programming
Multi-Agent Systems and Negotiation
article

CAN-Verify: Automated analysis for BDI agents

Blair Archibald, Michele Sevegnani, Mengwei Xu
article en

Abstract

We present CAN-Verify , an automated tool for analysing BDI agents written in the Conceptual Agent Notation ( Can ) language. CAN-Verify includes support for syntactic error detection before agent execution, agent program interpretation (running agents), and model-checking of agent programs (analysing agents). The model checking supports verifying the correctness of agents against both generic agent requirements, such as if a task is accomplished, and user-defined requirements, such as certain beliefs eventually holding. The latter can be expressed in structured natural language, allowing the tool to be used by agent programmers without formal training in the underlying verification techniques.

Science of Computer ProgrammingVol. 241
University of Glasgow (GB), Newcastle University (GB)
Newcastle University, Engineering and Physical Sciences Research Council
Openalex Percentile: Top 82%
Multi-Agent Systems and Negotiation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

CAN-Verify: Automated analysis for BDI agents — Blair Archibald, Michele Sevegnani, et al. · Science of Computer Programming (2024) | TGRS Research Map | TGRS