Learn More
In this report we present the Emotional-BDI architecture, an extension to the BDI architecture supporting Artificial Emotions and including internal representations for agent's 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(More)
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 E BDI 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 E BDI logic and show how it can(More)
This work presents a mechanically verified implementation of an algorithm for deciding regular expression (in-)equivalence within the Coq proof assistant. This algorithm decides regular expression equivalence through an iterated process of testing the equivalence of their partial derivatives and also does not construct the underlying automata. Our(More)
Prey can invest in a variety of defensive traits when balancing risk of predation against that of starvation. What remains unknown is the relative costs of different defensive traits and how prey reconcile investment into these traits when energetically limited. We tested the simple allocation model of prey defense, which predicts an additive effect of(More)
Kleene algebra (KA) is an algebraic system that captures properties of several important structures arising in Computer Science like automata and formal languages, among others. In this paper we present a formalization of regular languages as a KA in the Coq theorem prover. In particular, we describe the implementation of an algorithm for deciding regular(More)
Over the past decades several approaches for schedulability analysis have been proposed for both uni-processor and multi-processor real-time systems. Although different techniques are employed, very little has been put forward in using formal specifications, with the consequent possibility for misinterpretations or ambiguities in the problem statement.(More)
Runtime Monitoring of hard real-time embedded systems is a promising technique for ensuring that a running system respects timing constraints, possibly combined with faults originated by the software and/or hardware. This is particularly important when we have real-time embedded systems made of several components that must combine different levels of(More)