Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

Publications by Guillermina Cledou

2016

An Ontology for Licensing Public Transport Services

Authors
Cledou, G; Barbosa, LS;

Publication
9TH INTERNATIONAL CONFERENCE ON THEORY AND PRACTICE OF ELECTRONIC GOVERNANCE (ICEGOV 2016)

Abstract
By 2050 it is expected that 66% of the world population will reside in cities, compared to 54% in 2014. One particular challenge associated to urban population growth refers to transportation systems, and as an approach to face it, governments are investing significant efforts enhancing public transport services. An important aspect of public transport is ensuring that licensing of such services fulfill existing government regulations. Due to the differences in government regulations, and to the difficulties in ensuring the fulfillment of their specific features, many local governments develop tailored Information and Communication Technology (ICT) solutions to automate the licensing of public transport services. In this paper we propose an ontology for licensing such services following the REFSENO methodology. In particular, the ontology captures common concepts involved in the application and processing stage of licensing public bus passenger services. The main contribution of the proposed ontology is to define a common vocabulary to share knowledge between domain experts and software engineers, and to support the definition of a software product line for families of public transport licensing services.

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.

2013

WeLEaD: collaborative toolkit for learning, engaging and deciding

Authors
Cledou, MG; Fernandes, S; Estevez, E;

Publication
7th International Conference on Theory and Practice of Electronic Governance, ICEGOV '13, Seoul, Republic of Korea, October 22-25, 2013

Abstract

2014

Understanding students' mobility habits towards the implementation of an adaptive ubiquitous platform

Authors
Casal, J; Cledou, G;

Publication
ACM International Conference Proceeding Series

Abstract
Adapting technological environments to users is a concern since Mark Weiser launched the concept of ubiquitous computing and, in order to do that, is necessary to understand users' characteristics. In this context, the purpose of this paper is to present a study about students' mobility habits within a university campus, having the intention of getting insights towards the best place to set an interactive public display and of predicting the main characteristics of the audience that will be present on that spot in forthcoming periods. Thus, the envisioned results of this work will allow the adaptation of the contents exhibited on the device to the audience. To perform the study, a set of logs of accesses to the university's Wi-Fi was used, data mining techniques were implemented and forecasting models were built, using the line of work suggested by the CRISP-DM methodology. As result, students profile were built based on past wireless accesses and on their scholar schedules, and three time series models were used (Holt-Winters, Seasonal Naive and Simple Exponential Smoothing) to predict the presence of students on the envisioned spot in future periods. © 2014 ACM.

2013

WeLEaD

Authors
Cledou, MG; Fernandes, S; Estevez, E;

Publication
Proceedings of the 7th International Conference on Theory and Practice of Electronic Governance - ICEGOV '13

Abstract

  • 1
  • 3