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
About
Download Photo HD

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
  • Role

    Assistant Researcher
  • Since

    01st January 2014
  • Nationality

    Portugal
  • Contacts

    +351253604440
    renato.j.neves@inesctec.pt
002
Publications

2019

Limits in Categories of Vietoris Coalgebras

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

Publication
CoRR

Abstract

2019

An Adequate While-Language for Hybrid Computation

Authors
Goncharov, S; Neves, R;

Publication
PROCEEDINGS OF THE 21ST INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING (PPDP 2019)

Abstract
Hybrid computation harbours discrete and continuous dynamics in the form of an entangled mixture, inherently present in various natural phenomena and in applications ranging from control theory to microbiology. The emergent behaviours bear signs of both computational and physical processes, and thus present difficulties not only in their analysis, but also in describing them adequately in a structural, well-founded way. In order to tackle these issues and, more generally, to investigate hybridness as a dedicated computational phenomenon, we introduce a while-language for hybrid computation inspired by the fine-grain call-by-value paradigm. We equip it with operational and computationally adequate denotational semantics. The latter crucially relies on a hybrid monad supporting an (Elgot) iteration operator that we developed elsewhere. As an intermediate step, we introduce a more lightweight duration semantics furnished with analogous results and based on a new duration monad that we introduce as a lightweight counterpart to the hybrid monad.

2019

An Adequate While-Language for Hybrid Computation

Authors
Goncharov, S; Neves, R;

Publication
CoRR

Abstract

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.