João Carlos Basilio

João Carlos Basilio

Auto-generated profile, based on publicly available information

João Carlos Basilio

Electrical Engineering Department, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 January 2018 in Discrete Event Dynamic Systems
Verified
Journal Article
Closed access
PDF file
CNCarlos E. V. Nunes
Carlos E. V. Nunes
MMMarcos V. Moreira
Marcos V. Moreira
MAMarcos V. S. Alves
Marcos V. S. Alves
LCLilian K. Carvalho
Lilian K. Carvalho
JBJoão Carlos Basilio
João Carlos Basilio

17 August 2021 in Foundations and Trends® in Systems and Control
Verified
Journal Article
Closed access
PDF file
CJCarlos Basilio João
Carlos Basilio João
NCN. Hadjicostis Christoforos
N. Hadjicostis Christoforos
RSRong Su
Rong Su
System resilience captures the ability of the system to withstand a major disruption within acceptable performance degradation and to recover within an acceptable time frame. In this monograph we consider two possible sources of major disruptions, i.e., component faults and cyber intrusions. A component fault is an indigenous activity that renders unavailability or inaccessibility of certain functions within a component, either permanently or temporarily. It typically generates safety and performance concerns. Cyber intrusion on the other hand is an exogenous activity that tampers privacy, confidentiality, availability, or integrity of the system. These two sources are not always independent from each other. For example, a cyber intrusion may trigger a component fault, whereas a component fault may open a door for cyber intrusion, e.g., by keeping it undetected. For cyber intrusion, we will focus on opacity, which describes the system’s ability to hide certain secrets from an external observer (or eavesdropper), and sensor and actuator attacks that exploit the system’s existing controller to generate undesirable behaviours. In this monograph, we provide a detailed account of most recent research outcomes on fault diagnosis, opacity analysis and enhancement, and cyber security analysis and enforcement, within suitable discrete event system modelling frameworks. In each case, we describe basic problem statements and key concepts, and then point out the key challenges in each research area. After that, we present a thorough review of state-of-the-art techniques, and discuss their advantages and disadvantages. Finally, we highlight key research directions for further exploration.

29 January 2012 in Discrete Event Dynamic Systems
Verified
Journal Article
Closed access
PDF file
JBJoão Carlos Basilio
João Carlos Basilio
SLSaulo Telles Souza Lima
Saulo Telles Souza Lima
SLStéphane Lafortune
Stéphane Lafortune
MMMarcos Vicente Moreira
Marcos Vicente Moreira

7 July 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
MAMarcos Vincius Silva Alves
Marcos Vincius Silva Alves
LCLilian Kawakami Carvalho
Lilian Kawakami Carvalho
JBJoao Carlos Basilio
Joao Carlos Basilio
In this paper, we study the supervisory control problem of Networked Discrete Event Systems with Timing Structure (NDESWTS) assuming bounded communication delays and intermittent loss of observations. The communication between the plant and the supervisor is through a network that can have several channels, and so, communication delays may change the order of event observations by the supervisor. We assume a priori knowledge of the minimal transition activation time and the maximum communication delays, and propose an equivalent untimed model that takes into account all possible observation delays and also loss of observations. Based on this model, we formulate a networked supervisory control problem and show that it can be converted into an equivalent range control problem. We also address implementation for presenting a representation for networked supervisors that is able to deal with possible loss of synchronization between event occurrence and its observation.

7 September 2020 in Discrete Event Dynamic Systems
Verified
Journal Article
Closed access
PDF file
ABAbderraouf Boussif
Abderraouf Boussif
MGMohamed Ghazel
Mohamed Ghazel
JBJoão Carlos Basilio
João Carlos Basilio

4 February 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
GVGustavo S. Viana
Gustavo S. Viana
MMMarcos V. Moreira
Marcos V. Moreira
JBJoao Carlos Basilio
Joao Carlos Basilio
In building failure diagnosis systems for discrete-event systems, two performance indexes must be specified: (i) the maximum time the diagnosis system takes to detect the failure occurrence, usually referred to as T-diagnosability; and (ii) if no time information is available, how many events must occur after the failure in order for the diagnosis system to detect and isolate its occurrence, usually referred to as K-diagnosability. In this technical note, we consider the problem of verifying if these specifications can be met for discrete-event systems modeled by finite weighted automaton; we regard the ordinary finite automaton as a particular case of weighted automaton with all weights equal to one. The resulting algorithms have polynomial time complexity, being the lowest worst case computational complexity among those already proposed in the literature for T- and K-codiagnosability verification of finite state automata.