Methodologies synthesis

This deliverable deals with the modelling and analysis of interdependencies between critical infrastructures, focussing attention on two interdependent infrastructures studied in the context of CRUTIAL: the electric power infrastructure and the information infrastructures supporting management, control and maintenance functionality. The main objectives are: 1) investigate the main challenges to be addressed for the analysis and modelling of interdependencies, 2) review the modelling methodologies and tools that can be used to address these challenges and support the evaluation of the impact of interdependencies on the dependability and resilience of the service delivered to the users, and 3) present the preliminary directions investigated so far by the CRUTIAL consortium for describing and modelling interdependencies

Stochastic Shortest Path with Energy Constraints in POMDPs

We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize the expected total cost until the target set is reached. We extend the traditional framework of POMDPs to model energy consumption, which represents a hard constraint. The energy levels may increase and decrease with transitions, and the hard constraint requires that the energy level must remain positive in all steps till the target is reached. First, we present a novel algorithm for solving POMDPs with energy levels, developing on existing POMDP solvers and using RTDP as its main method. Our second contribution is related to policy representation. For larger POMDP instances the policies computed by existing solvers are too large to be understandable. We present an automated procedure based on machine learning techniques that automatically extracts important decisions of the policy allowing us to compute succinct human readable policies. Finally, we show experimentally that our algorithm performs well and computes succinct policies on a number of POMDP instances from the literature that were naturally enhanced with energy levels.Comment: Technical report accompanying a paper published in proceedings of AAMAS 201

Performance modelling and the representation of large scale distributed system functions

This thesis presents a resource based approach to model generation for performance characterization and correctness checking of large scale telecommunications networks. A notion called the timed automaton is proposed and then developed to encapsulate behaviours of networking equipment, system control policies and non-deterministic user behaviours. The states of pooled network resources and the behaviours of resource consumers are represented as continually varying geometric patterns; these patterns form part of the data operated upon by the timed automata. Such a representation technique allows for great flexibility regarding the level of abstraction that can be chosen in the modelling of telecommunications systems. None the less, the notion of system functions is proposed to serve as a constraining framework for specifying bounded behaviours and features of telecommunications systems. Operational concepts are developed for the timed automata; these concepts are based on limit preserving relations. Relations over system states represent the evolution of system properties observable at various locations within the network under study. The declarative nature of such permutative state relations provides a direct framework for generating highly expressive models suitable for carrying out optimization experiments. The usefulness of the developed procedure is demonstrated by tackling a large scale case study, in particular the problem of congestion avoidance in networks; it is shown that there can be global coupling among local behaviours within a telecommunications network. The uncovering of such a phenomenon through a function oriented simulation is a contribution to the area of network modelling. The direct and faithful way of deriving performance metrics for loss in networks from resource utilization patterns is also a new contribution to the work area

AFRANCI : multi-layer architecture for cognitive agents

Tese de doutoramento. Engenharia Electrotécnica e de Computadores. Faculdade de Engenharia. Universidade do Porto. 201

Designing Trustworthy Autonomous Systems

The design of autonomous systems is challenging and ensuring their trustworthiness can have different meanings, such as i) ensuring consistency and completeness of the requirements by a correct elicitation and formalization process; ii) ensuring that requirements are correctly mapped to system implementations so that any system behaviors never violate its requirements; iii) maximizing the reuse of available components and subsystems in order to cope with the design complexity; and iv) ensuring correct coordination of the system with its environment.Several techniques have been proposed over the years to cope with specific problems. However, a holistic design framework that, leveraging on existing tools and methodologies, practically helps the analysis and design of autonomous systems is still missing. This thesis explores the problem of building trustworthy autonomous systems from different angles. We have analyzed how current approaches of formal verification can provide assurances: 1) to the requirement corpora itself by formalizing requirements with assume/guarantee contracts to detect incompleteness and conflicts; 2) to the reward function used to then train the system so that the requirements do not get misinterpreted; 3) to the execution of the system by run-time monitoring and enforcing certain invariants; 4) to the coordination of the system with other external entities in a system of system scenario and 5) to system behaviors by automatically synthesize a policy which is correct

Energy efficient path planning and model checking for long endurance unmanned surface vehicles.

In this dissertation, path following, path planning, collision avoidance and model checking algorithms were developed and simulated for improving the level of autonomy for Unmanned Surface Vehicle (USV). Firstly, four path following algorithms, namely, Carrot Chasing, Nonlinear Guidance Law, Pure pursuit and LOS, and Vector Field algorithms, were compared in simulation and Carrot Chasing was tested in Unmanned Safety Marine Operations Over The Horizon (USMOOTH) project. Secondly, three path planning algorithms, including Voronoi-Visibility shortest path planning, Voronoi-Visibility energy efficient path planning and Genetic Algorithm based energy efficient path planning algorithms, are presented. Voronoi-Visibility shortest path planning algorithm was proposed by integrating Voronoi diagram, Dijkstra’s algorithm and Visibility graph. The path quality and computational efficiency were demonstrated through comparing with Voronoi algorithms. Moreover, the proposed algorithm ensured USV safety by keeping the USV at a configurable clearance distance from the coastlines. Voronoi-Visibility energy efficient path planning algorithm was proposed by taking sea current data into account. To address the problem of time-varying sea current, Genetic Algorithm was integrated with Voronoi-Visibility energy efficient path planning algorithm. The energy efficiency of Voronoi-Visibility and Genetic Algorithm based algorithms were demonstrated in simulated missions. Moreover, collision avoidance algorithm was proposed and validated in single and multiple intruders scenarios. Finally, the feasibility of using model checking for USV decision-making systems verification was demonstrated in three USV mission scenarios. In the final scenario, a multi-agent system, including two USVs, an Unmanned Aerial Vehicle (UAV), a Ground Control Station (GCS) and a wireless mesh network, were modelled using Kripke modelling algorithm. The modelled uncertainties include communication loss, collision risk, fault event and energy states. Three desirable properties, including safety, maximum endurance, and fault tolerance, were expressed using Computational Tree Logic (CTL), which were verified using Model Checker for Multi-Agent System (MCMAS). The verification results were used to retrospect and improve the design of the decision-making system.PhD in Aerospac