51 citations · 126 across the 15 of their papers we have counts for
15 papers
Probabilistic State Estimation of Timed Probabilistic Discrete Event Systems via Artificial Neural Networks [Draft Version]
Omar Amri, Carla Seatzu, Alessandro Giua +1
This paper is about the state estimation of timed probabilistic discrete event systems. The main contribution is to propose general procedures for developing state estimation appro…
State estimation of timed automata under partial observation [Draft version]
Chao Gao, Dimitri Lefebvre, Carla Seatzu +2
In this paper, we consider partially observable timed automata endowed with a single clock. A time interval is associated with each transition specifying at which clock values it m…
[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
Kuize Zhang, Xiaoguang Han, Alessandro Giua +1
In this paper, we consider labeled finite-state automata (LFSAs), extend some state estimation-based properties from a single agent to a finite ordered set of agents. We also exten…
Novel Stability Conditions for Nonlinear Monotone Systems and Consensus in Multi-Agent Networks
Diego Deplano, Mauro Franceschelli, Alessandro Giua
In this work, we characterize a class of nonlinear monotone dynamical systems that have a certain translation invariance property which goes by the name of plus-homogeneity; usuall…
You Don't Know What I Know: On Notion of High-Order Opacity in Discrete-Event Systems
Bohan Cui, Xiang Yin, Shaoyuan Li +1
In this paper, we investigate a class of information-flow security properties called opacity in partial-observed discrete-event systems. Roughly speaking, a system is said to be op…
Non-Blockingness Verification of Bounded Petri Nets Using Basis Reachability Graphs -- An Extended Version With Benchmarks
Chao Gu, Ziyue Ma, Zhiwu Li +1
In this paper, we study the problem of non-blockingness verification by tapping into the basis reachability graph (BRG). Non-blockingness is a property that ensures that all pre-sp…
Dynamic Max-Consensus and Size Estimation of Anonymous Multi-Agent Networks
Diego Deplano, Mauro Franceschelli, Alessandro Giua
In this paper we propose a novel consensus protocol for discrete-time multi-agent systems (MAS), which solves the dynamic consensus problem on the max value, i.e., the dynamic max-…
A framework for the analysis of supervised discrete event systems under attack
Qi Zhang, Carla Seatzu, Zhiwu Li +1
This paper focuses on the problem of cyber attacks for discrete event systems under supervisory control. In more detail, the goal of the supervisor, who has a partial observation o…
Verification of Nonblockingness in Bounded Petri Nets With Minimax Basis Reachability Graphs
Chao Gu, Ziyue Ma, Zhiwu Li +1
This paper proposes a semi-structural approach to verify the nonblockingness of a Petri net. We construct a structure, called minimax basis reachability graph (minimax-BRG): it pro…
Revisiting delayed strong detectability of discrete-event systems
Kuize Zhang, Alessandro Giua
Among notions of detectability for a discrete-event system (DES), strong detectability implies that after a finite number of observations to every output/label sequence generated b…
A Nonlinear Perron-Frobenius Approach for Stability and Consensus of Discrete-Time Multi-Agent Systems
Diego Deplano, Mauro Franceschelli, Alessandro Giua
In this paper we propose a novel method to establish stability and, in addition, convergence to a consensus state for a class of discrete-time Multi-Agent System (MAS) evolving acc…
Joint State Estimation Under Attack of Discrete Event Systems
Qi Zhang, Carla Seatzu, Zhiwu Li +1
The problem of state estimation in the setting of partially-observed discrete event systems subject to cyber attacks is considered. An operator observes a plant through a natural p…
On detectability of labeled Petri nets and finite automata
Kuize Zhang, Alessandro Giua
We study detectability properties for labeled Petri nets and finite automata. We first study weak approximate detectability (WAD) that implies that there exists an infinite observe…
Testing experiments on synchronized Petri nets
M. Pocci, I. Demongodin, N. Giambiasi +1
Synchronizing sequences have been proposed in the late 60's to solve testing problems on systems modeled by finite state machines. Such sequences lead a system, seen as a black box…
Decentralized Estimation of Laplacian Eigenvalues in Multi-Agent Systems
Mauro Franceschelli, Andrea Gasparri, Alessandro Giua +1
In this paper we present a decentralized algorithm to estimate the eigenvalues of the Laplacian matrix that encodes the network topology of a multi-agent system. We consider networ…