Tzanis Anevlavis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tzanis Anevlavis has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Paulo Tabuada
University of California, Los Angeles
2 shared publications - Abel Souza
University of California, Santa Cruz, CA, USA
1 shared publication - Bhaskar Krishnamachari
Ming Hsieh Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA
1 shared publication - Christina Fragouli
Electrical and Computer Engineering Department, University of California at Los Angeles, Los Angeles, CA, USA
1 shared publication Daniel Neider
Max Planck Institute for Software Systems, Kaiserslauten, Germany
1 shared publicationEugenio Grippo
The Univ. of Southern California (United States)
1 shared publication
Latest Publications
- 27 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (7) , 4506-4521
Controlled Invariant Sets: Implicit Closed-Form Representations and Applications
We revisit the problem of computing (robust) controlled invariant sets for discrete-time linear systems. Departing from previous approaches, we consider implicit, rather than explicit, representations for controlled invariant sets. Moreover, by considering such representations in the space of states and finite input sequences we obtain closed-form expressions for controlled invariant sets. An immediate advantage is the ability to handle high-dimensional systems since the closed-form expression is computed in a single step rather than iteratively. To validate the proposed method, we present thorough case studies illustrating that in safety-critical scenarios the implicit representation suffices in place of the explicit invariant set. The proposed method is complete in the absence of disturbances, and we provide a weak completeness result when disturbances are present.
- 27 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (7) , 4506-4521
Controlled Invariant Sets: Implicit Closed-Form Representations and Applications
We revisit the problem of computing (robust) controlled invariant sets for discrete-time linear systems. Departing from previous approaches, we consider implicit, rather than explicit, representations for controlled invariant sets. Moreover, by considering such representations in the space of states and finite input sequences we obtain closed-form expressions for controlled invariant sets. An immediate advantage is the ability to handle high-dimensional systems since the closed-form expression is computed in a single step rather than iteratively. To validate the proposed method, we present thorough case studies illustrating that in safety-critical scenarios the implicit representation suffices in place of the explicit invariant set. The proposed method is complete in the absence of disturbances, and we provide a weak completeness result when disturbances are present.
- 6 June 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12113, 199-206
Network synthesis for tactical environments: scenario, challenges, and opportunities
We develop a network synthesis scenario, which is built around a concrete perimeter surveillance application, yet we believe captures a number of the challenges and requirements that are common to other tactical communication and computational network applications. The proposed scenario addresses the problem of binary population identification within a perimeter: our goal is to synthesize a sensing and computing network that classifies people moving within a given perimeter into one of two categories (e.g., friend or foe). We discuss several open challenges that we organize across the following clusters: sensor placement, communication network provisioning and optimization, computational task placement, dynamic re-synthesis and resilience under adversarial settings. We also briefly discuss approaches that attempt to address such challenges.
- 6 June 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12113, 199-206
Network synthesis for tactical environments: scenario, challenges, and opportunities
We develop a network synthesis scenario, which is built around a concrete perimeter surveillance application, yet we believe captures a number of the challenges and requirements that are common to other tactical communication and computational network applications. The proposed scenario addresses the problem of binary population identification within a perimeter: our goal is to synthesize a sensing and computing network that classifies people moving within a given perimeter into one of two categories (e.g., friend or foe). We discuss several open challenges that we organize across the following clusters: sensor placement, communication network provisioning and optimization, computational task placement, dynamic re-synthesis and resilience under adversarial settings. We also briefly discuss approaches that attempt to address such challenges.
- Open Access
- 14 January 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 23 (2) , 1-39
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic
While most approaches in formal methods address system correctness, ensuring robustness has remained a challenge. In this article, we present and study the logic rLTL, which provides a means to formally reason about both correctness and robustness in system design. Furthermore, we identify a large fragment of rLTL for which the verification problem can be efficiently solved, i.e., verification can be done by using an automaton, recognizing the behaviors described by the rLTL formula φ, of size at most O(3 |φ |), where |φ | is the length of φ. This result improves upon the previously known bound of O(5|φ |) for rLTL verification and is closer to the LTL bound of O(2|φ |). The usefulness of this fragment is demonstrated by a number of case studies showing its practical significance in terms of expressiveness, the ability to describe robustness, and the fine-grained information that rLTL brings to the process of system verification. Moreover, these advantages come at a low computational overhead with respect to LTL verification.
- 14 January 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 23 (2) , 1-39
Open AccessBeing Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic
While most approaches in formal methods address system correctness, ensuring robustness has remained a challenge. In this article, we present and study the logic rLTL, which provides a means to formally reason about both correctness and robustness in system design. Furthermore, we identify a large fragment of rLTL for which the verification problem can be efficiently solved, i.e., verification can be done by using an automaton, recognizing the behaviors described by the rLTL formula φ, of size at most O(3 |φ |), where |φ | is the length of φ. This result improves upon the previously known bound of O(5|φ |) for rLTL verification and is closer to the LTL bound of O(2|φ |). The usefulness of this fragment is demonstrated by a number of case studies showing its practical significance in terms of expressiveness, the ability to describe robustness, and the fine-grained information that rLTL brings to the process of system verification. Moreover, these advantages come at a low computational overhead with respect to LTL verification.