David Pereira

Towards an Architecture for Emotional BDI Agents

In this paper we present the emotional-BDI architecture, an extension to the BDI architecture supporting artificial emotions and including internal representations for agents capabilities and resources. The architecture we present here is conceptual, defining which components should exist so that emotional-BDI agents can use effective capabilities as well as effective resources in order to better cope with highly dynamic environments

Formal Modelling of Emotions in BDI Agents

Emotional-BDI agents are BDI agents whose behaviour is guided not only by beliefs, desires and intentions, but also by the role of emotions in reasoning and decision-making. The

Partial derivative automata formalized in Coq

\mathcal{E}_{\rm BDI}

RTFM-core: Language and implementation

logic is a formal system for expressing the concepts of the Emotional-BDI model of agency. In this paper we present an improved version of the

Deciding regular expressions (in-)equivalence in coq

\mathcal{E}_{\rm BDI}

Logic-based schedulability analysis for compositional hard real-time embedded systems

logic and show how it can be used to model the role of three emotions in Emotional-BDI agents: fear , anxiety and self-confidence . We also focus in the computational properties of

A real-time semantics for the IEC 61499 standard

\mathcal{E}_{\rm BDI}

A Novel Run-Time Monitoring Architecture for Safe and Efficient Inline Monitoring

which can lead to its use in automated proof systems.

A Compositional Monitoring Framework for Hard Real-Time Systems

In this paper we present a computer assisted proof of the correctness of a partial derivative automata construction from a regular expression within the Coq proof assistant. This proof is part of a formalization of Kleene algebra and regular languages in Coq towards their usage in program certification.

Towards a Runtime Verification Framework for the Ada Programming Language

Robustness, real-time properties and resource efficiency are key properties to embedded devices of the CPS/IoT era. In this paper we propose a language approach RTFM-core, and show its potential to facilitate the development process and provide highly efficient and statically verifiable implementations. Our programming model is reactive, based on the familiar notions of concurrent tasks and (single-unit) resources. The language is kept minimalistic, capturing the static task, communication and resource structure of the system. Whereas C-source can be arbitrarily embedded in the model, and/or externally referenced, the instep to mainstream development is minimal, and a smooth transition of legacy code is possible. A prototype compiler implementation for RTFM-core is presented. The compiler generates C-code output that compiled together with the RTFM-kernel primitives runs on bare metal. The RTFM-kernel guarantees deadlock-lock free execution and efficiently exploits the underlying interrupt hardware for static priority scheduling and resource management under the Stack Resource Policy. This allows a plethora of well-known methods to static verification (response time analysis, stack memory analysis, etc.) to be readily applied. The proposed language and supporting tool-chain is demonstrated by showing the complete process from RTFM-core source code into bare metal executables for a lightweight ARM-Cortex M3 target.