Zobrazeno 1 - 10
of 520
pro vyhledávání: '"Giua, Alessandro"'
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 may occur. In addition, a resetting condition associated to a transitio
Externí odkaz:
http://arxiv.org/abs/2409.05810
State-estimation-based properties are central properties in discrete-event systems modeled by labeled finite-state automata studied over the past 3 decades. Most existing results are based on a single agent who knows the structure of a system and can
Externí odkaz:
http://arxiv.org/abs/2408.06141
This paper studies the problem of increasing the connectivity of an ad-hoc peer-to-peer network subject to cyber-attacks targeting the agents in the network. The adopted strategy involves the design of local interaction rules for the agents to locall
Externí odkaz:
http://arxiv.org/abs/2406.18467
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; usually called "topical" systems. Such systems need not be asymptotically st
Externí odkaz:
http://arxiv.org/abs/2301.05140
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 opaque if the intruder, which is modeled by a passive observer, can neve
Externí odkaz:
http://arxiv.org/abs/2203.17051
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-specified tasks can be completed, which is a mandatory requirement durin
Externí odkaz:
http://arxiv.org/abs/2103.02475
Publikováno v:
In IFAC PapersOnLine 2024 58(1):174-179
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-consensus problem. In the dynamic max-consensus problem to each agent
Externí odkaz:
http://arxiv.org/abs/2009.03858
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 of the system evolution, is that of preventing the system from reaching
Externí odkaz:
http://arxiv.org/abs/2005.00212
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 provides an abstract description of the reachability set of a net while p
Externí odkaz:
http://arxiv.org/abs/2003.14204