The objectives of this research are to further investigate the foundations for novel SMT and SAT-based bounded model checking (BMC) algorithms for real-time and multi-agent systems. A major part of the research will involve the development of SMT-based ...

This paper states the challenges for modeling and reasoning strategic behaviour of agents in multi-agent systems. After a brief review of logical analysis of games, we specify the problem we are tackling, and then briefly outline our research plan, the ...

The computer-based simulation of military tactics has largely involved the use of platform-dependent scripting resulting in behaviour that is limited, and difficult to debug and reuse. The Tactics Development Framework (TDF) addresses these shortcomings ...

Our focus is on the specification and verification of normative systems that include contrary-to-duty, collective and event-driven imperatives with deadlines. We propose an operational syntax and semantics for the specification of such systems. Using ...

Representation of ignorance about large numbers --- agent a does not know agent b's key --- is not feasible in standard Kripke semantics. The paper introduces register models that allow for compact representation of such ignorance. This is used to ...

Runtime verification concerns checking whether a system execution satisfies a given property. In this paper we propose a model for collaborative runtime verification where a network of local monitors collaborates in order to verify properties of the ...

Considerable progress has been achieved in the past ten years in the symbolic verification of Multi-Agent Systems (MAS). One of the most efficient techniques put forward is based on the use of ordered binary decision diagrams (OBDDs) for representing the ...

This paper presents a method aimed to assist an engineer in transforming agent roles models to a process model, compliant with the XML Process Definition Language (XPDL) portable standard. This method bridges the gap between software engineers and the ...

We define the SMT-based bounded model checking (BMC) method for Weighted Interpreted Systems and for the existential fragment of the Weighted Epistemic Computation Tree Logic. We implemented the new BMC algorithm and compared it with the SAT-based BMC ...

Agent-based technologies, originally proposed with the aim of assisting human activities, have been recently adopted in industry for automating business processes. Business Process Model and Notation (BPMN) is a standard notation for modeling business ...

Agent systems are used for a wide range of applications, and techniques to detect and avoid defects in such systems are valuable. In particular, it is desirable to detect issues as early as possible in the software development lifecycle. We describe a ...

A key requirement in military simulation is to have executable models of tactical decision-making. Such models are used to simulate the behaviour of human entities such as submarine commanders, fighter pilots and infantry, with a view to producing ...

Due to their internal complexity, agent-based simulations are rarely amenable to conventional formal verification. With its focus on individual traces, runtime verification represents an interesting alternative for correctness assessment. Here, ...

The interoperability of interacting components means that their expectations of each other remain in agreement. A commitment captures what one agent (its creditor) may expect from another agent (its debtor). Chopra and Singh (C&S) motivate commitment ...

We address the question of how an agent can adapt its behavior to comply with newly adopted norms. This is particularly relevant in the case of open systems where agents may enter and leave norm-governed social contexts not known at design time. This ...

Automata walking on graphs are a mathematical formalisation of autonomous mobile agents with limited memory operating in discrete environments. This paper establishes a framework in which to model and automatically verify that autonomous mobile agents ...

We develop the theoretical foundations of a predicate abstraction methodology for the verification of multi-agent systems. We put forward a specification language based on epistemic logic and a weak variant of the logic ATL interpreted on a three-valued ...

The multifaceted complexity of real-time strategy (RTS) games forces AI systems to break down policy computation into smaller subproblems -- strategic planning, tactical planning, reactive control, and others. To further simplify planning at the ...

Online search in games has been a core interest of artificial intelligence. Search in imperfect information games (e.g., Poker, Bridge, Skat) is particularly challenging due to the complexities introduced by hidden information. In this paper, we present ...

Clustering agents by their behaviour can be crucial for building effective agent models. Traditional clustering typically aims to group entities together based on a distance metric, where a desirable clustering is one where the entities in a cluster are ...