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'm a PhD student, under the MAP-i doctoral programme, whose theme is logics and calculi for cyber–physical components.

I'm mainly interested in the foundations of cyber physical systems; coalgebras, proof theory and institutional theory; also, in a myriad of logics, but particularly in modal logics.

I participated in project Mondrian and I'm currently a member of the project Dalí.

Google scholar

DBLP

Contacts : nevrenato at di dot uminho dot pt

My Website gathers all the information about my academical activities.

Interest
Topics
Details

Details

  • Name

    Renato Jorge Neves
  • Cluster

    Computer Science
  • Role

    Researcher
  • Since

    01st January 2014
Publications

2018

Languages and models for hybrid automata: A coalgebraic perspective

Authors
Neves, R; Barbosa, LS;

Publication
THEORETICAL COMPUTER SCIENCE

Abstract
We study hybrid automata from a coalgebraic point of view. We show that such a perspective supports a generic theory of hybrid automata with a rich palette of definitions and results. This includes, among other things, notions of bisimulation and behaviour, state minimisation techniques, and regular expression languages.

2018

Generating the algebraic theory of C(X): The case of partially ordered compact spaces

Authors
Hofmann, D; Neves, R; Nora, P;

Publication
Theory and Applications of Categories

Abstract
It is known since the late 1960’s that the dual of the category of compact Hausdorff spaces and continuous maps is a variety-not ffnitary, but bounded by ?1. In this note we show that the dual of the category of partially ordered compact spaces and monotone continuous maps is an ?1-ary quasivariety, and describe partially its algebraic theory. Based on this description, we extend these results to categories of Vietoris coalgebras and homomorphisms on ordered compact spaces. We also characterise the ?1-copresentable partially ordered compact spaces. © Dirk Hofmann, Renato Neves, and Pedro Nora, 2018.

2018

A Semantics for Hybrid Iteration

Authors
Goncharov, S; Jakob, J; Neves, R;

Publication
29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China

Abstract

2016

A method for rigorous design of reconfigurable systems

Authors
Madeira, A; Neves, R; Barbosa, LS; Martins, MA;

Publication
SCIENCE OF COMPUTER PROGRAMMING

Abstract
Reconfigurability, understood as the ability of a system to behave differently in different modes of operation and commute between them along its lifetime, is a cross-cutting concern in modern Software Engineering. This paper introduces a specification method for reconfigurable software based on a global transition structure to capture the system's reconfiguration space, and a local specification of each operation mode in whatever logic (equational, first-order, partial, fuzzy, probabilistic, etc.) is found expressive enough for handling its requirements. In the method these two levels are not only made explicit and juxtaposed, but formally interrelated. The key to achieve such a goal is a systematic process of hybridisation of logics through which the relationship between the local and global levels of a specification becomes internalised in the logic itself.

2016

An exercise on the generation of many-valued dynamic logics

Authors
Madeira, A; Neves, R; Martins, MA;

Publication
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING

Abstract
In the last decades, dynamic logics have been used in different domains as a suitable formalism to reason about and specify a wide range of systems. On the other hand, logics with many-valued semantics are emerging as an interesting tool to handle devices and scenarios where uncertainty is a prime concern. This paper contributes towards the combination of these two aspects through the development of a method for the systematic construction of many-valued dynamic logics. Technically, the method is parameterised by an action lattice that defines both the computational paradigm and the truth space (corresponding to the underlying Kleene algebra and residuated lattices, respectively).