Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
About

About

I am a full-time PhD student at the MAP-i Doctoral Program in Computer Science held by the Universities of Minho, Porto and Aveiro, Portugal. The title of my PhD thesis is “A Virtual Factory for Smart City Service Integration”. The aim of the thesis is to advance the state of the art in software modelling and development tools for the rapid development of integrated city-level electronic public services.

I have a Licenciado degree in Computer Science from Universidad Nacional del Sur, Argentina. The title of my thesis is "Implementation of Autonomous Agents for Real-Time Scenarios Using Defeasible Logic as Knowledge Base".

My current research interests include: modeling and verification of software product lines; workflow specification, integration and verification; and all of them applied to e-governance. 

Interest
Topics
Details

Details

  • Name

    Guillermina Cledou
  • Cluster

    Computer Science
  • Role

    Assistant Researcher
  • Since

    01st January 2014
001
Publications

2019

A Net-Based Formal Framework for Causal Loop Diagrams

Authors
Cledou, G; Nakajima, S;

Publication
Advances in Intelligent Systems and Computing - Complex Systems Design & Management Asia

Abstract

2019

Coordination of tasks on a real-time OS

Authors
Cledou, G; Proença, J; Sputh, BHC; Verhulst, E;

Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract
VirtuosoNext TM is a distributed real-time operating system (RTOS) featuring a generic programming model dubbed Interacting Entities. This paper focuses on these interactions, implemented as so-called Hubs. Hubs act as synchronisation and communication mechanisms between the application tasks and implement the services provided by the kernel as a kind of Guarded Protected Action with a well defined semantics. While the kernel provides the most basic services, each carefully designed, tested and optimised, tasks are limited to this handful of basic hubs, leaving the development of more complex synchronization and communication mechanisms up to application specific implementations. In this work we investigate how to support a programming paradigm to compositionally build new services, using notions borrowed from the Reo coordination language, and relieving tasks from coordination aspects while delegating them to the hubs. We formalise the semantics of hubs using an automata model, identify the behaviour of existing hubs, and propose an approach to build new hubs by composing simpler ones. We also provide tools and methods to analyse and simplify hubs under our automata interpretation. In a first experiment several hub interactions are combined into a single more complex hub, which raises the level of abstraction and contributes to a higher productivity for the programmer. Finally, we investigate the impact on the performance by comparing different implementations on an embedded board. © IFIP International Federation for Information Processing 2019.

2018

A taxonomy for planning and designing smart mobility services

Authors
Cledou, G; Estevez, E; Barbosa, LS;

Publication
Government Information Quarterly

Abstract

2017

A Refinement Relation for Families of Timed Automata

Authors
Cledou, G; Proenca, J; Barbosa, LS;

Publication
Formal Methods: Foundations and Applications - 20th Brazilian Symposium, SBMF 2017, Recife, Brazil, November 29 - December 1, 2017, Proceedings

Abstract
Software Product Lines (SPLs) are families of systems that share a high number of common assets while differing in others. In component-based systems, components themselves can be SPLs, i.e., each component can be seen as a family of variations, with different interfaces and functionalities, typically parameterized by a set of features and a feature model that specifies the valid combinations of features. This paper explores how to safely replace such families of components with more refined ones. We propose a notion of refinement for Interface Featured Timed Automata (IFTA), a formalism to model families of timed automata with support for multi-action transitions. We separate the notion of IFTA refinement into behavioral and variability refinement, i.e., the refinement of the underlying timed automata and feature model. Furthermore, we define behavioral refinement for the semantic level, i.e., transition systems, as an alternating simulation between systems, and lift this definition to IFTA refinement. We illustrate this notion with examples throughout the text and show that refinement is a pre-order and compositional. © Springer International Publishing AG 2017.

2017

Composing Families of Timed Automata

Authors
Cledou, G; Proenca, J; Barbosa, LS;

Publication
Fundamentals of Software Engineering - 7th International Conference, FSEN 2017, Tehran, Iran, April 26-28, 2017, Revised Selected Papers

Abstract
Featured Timed Automata (FTA) is a formalism that enables the verification of an entire Software Product Line (SPL), by capturing its behavior in a single model instead of product-by-product. However, it disregards compositional aspects inherent to SPL development. This paper introduces Interface FTA (IFTA), which extends FTA with variable interfaces that restrict the way automata can be composed, and with support for transitions with atomic multiple actions, simplifying the design. To support modular composition, a set of Reo connectors are modelled as IFTA. This separation of concerns increases reusability of functionality across products, and simplifies modelling, maintainability, and extension of SPLs. We show how IFTA can be easily translated into FTA and into networks of Timed Automata supported by UPPAAL. We illustrate this with a case study from the electronic government domain. © 2017, IFIP International Federation for Information Processing.