English
Related papers

Related papers: Specifying Robustness

200 papers

It is widely accepted that every system should be robust in that ``small'' violations of environment assumptions should lead to ``small'' violations of system guarantees, but it is less clear how to make this intuition mathematically…

Logic in Computer Science · Computer Science 2024-01-23 Satya Prakash Nayak , Daniel Neider , Rajarshi Roy , Martin Zimmermann

We consider the problem of controlling a heterogeneous multi-agent system required to satisfy temporal logic requirements. Capability Temporal Logic (CaTL) was recently proposed to formalize such specifications for deploying a team of…

Systems and Control · Electrical Eng. & Systems 2023-04-14 Wenliang Liu , Kevin Leahy , Zachary Serlin , Calin Belta

In multi-agent system design, a crucial aspect is to ensure robustness, meaning that for a coalition of agents A, small violations of adversarial assumptions only lead to small violations of A's goals. In this paper we introduce a logical…

Logic in Computer Science · Computer Science 2023-07-21 Aniello Murano , Daniel Neider , Martin Zimmermann

We robustify PCTL and PCTL*, the most important specification languages for probabilistic systems, and show that robustness does not increase the complexity of their model-checking problems.

Logic in Computer Science · Computer Science 2024-08-06 Martin Zimmermann

We propose the Robustness Temporal Logic (RobTL), a novel temporal logic for the specification and analysis of distances between the behaviours of Cyber-Physical Systems (CPSs) over a finite time horizon. Differently from classical temporal…

Logic in Computer Science · Computer Science 2022-12-22 Valentina Castiglioni , Michele Loreti , Simone Tini

Linear Temporal Logic (LTL) is the standard specification language for reactive systems and is successfully applied in industrial settings. However, many shortcomings of LTL have been identified in the literature, among them the limited…

Logic in Computer Science · Computer Science 2021-04-30 Daniel Neider , Alexander Weinert , Martin Zimmermann

Although it is widely accepted that every system should be robust, in the sense that "small" violations of environment assumptions should lead to "small" violations of system guarantees, it is less clear how to make this intuitive notion of…

Logic in Computer Science · Computer Science 2015-11-02 Paulo Tabuada , Daniel Neider

The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL+ by variables. Previous complexity results show that only fragments with one variable…

Logic in Computer Science · Computer Science 2015-05-13 Ahmet Kara , Martin Lange , Thomas Schwentick , Volker Weber

In the literature, two powerful temporal logic formalisms have been proposed for expressing information flow security requirements, that in general, go beyond regular properties. One is classic, based on the knowledge modalities of…

Logic in Computer Science · Computer Science 2014-09-10 Laura Bozzelli , Bastien Maubert , Sophie Pinchinat

In our previous work we have introduced the logic STL*, an extension of Signal Temporal Logic (STL) that allows value freezing. In this paper, we define robustness measures for STL* by adapting the robustness measures previously introduced…

Logic in Computer Science · Computer Science 2013-09-05 L. Brim , T. Vejpustek , D. Šafránek , J. Fabriková

Linear Temporal Logic (LTL) is the standard specification language for reactive systems and is successfully applied in industrial settings. However, many shortcomings of LTL have been identified in the literature, among them the limited…

Logic in Computer Science · Computer Science 2019-09-19 Daniel Neider , Alexander Weinert , Martin Zimmermann

Graded path modalities count the number of paths satisfying a property, and generalize the existential (E) and universal (A) path modalities of CTL*. The resulting logic is called GCTL*. We settle the complexity of satisfiability of GCTL*,…

Logic in Computer Science · Computer Science 2014-10-29 Benjamin Aminof , Aniello Murano , Sasha Rubin

The automated generation of agentic workflows is a promising frontier for enabling large language models (LLMs) to solve complex tasks. However, our investigation reveals that the robustness of agentic workflow remains a critical,…

Multiagent Systems · Computer Science 2025-10-07 Shengxiang Xu , Jiayi Zhang , Shimin Di , Yuyu Luo , Liang Yao , Hanmo Liu , Jia Zhu , Fan Liu , Min-Ling Zhang

Signal temporal logic (STL) is a powerful tool for describing complex behaviors for dynamical systems. Among many approaches, the control problem for systems under STL task constraints is well suited for learning-based solutions, because…

Systems and Control · Electrical Eng. & Systems 2020-03-16 Peter Varnai , Dimos V. Dimarogonas

While most of the current synthesis algorithms only focus on correctness-by-construction, ensuring robustness has remained a challenge. Hence, in this paper, we address the robust-by-construction synthesis problem by considering the…

Logic in Computer Science · Computer Science 2024-01-23 Satya Prakash Nayak , Daniel Neider , Martin Zimmermann

Building on the work by Fainekos and Pappas and the one by Donze and Maler, we introduce AvSTL, an extension of metric interval temporal logic by averaged temporal operators. Its expressivity in capturing both space and time robustness…

Systems and Control · Computer Science 2015-05-28 Takumi Akazaki , Ichiro Hasuo

We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the…

Logic in Computer Science · Computer Science 2016-05-25 Krishnendu Chatterjee , Laurent Doyen

The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining…

Databases · Computer Science 2024-02-14 Brecht Vandevoort , Bas Ketsman , Christoph Koch , Frank Neven

The isolation level Multiversion Read Committed (RC), offered by many database systems, is known to trade consistency for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining the…

Databases · Computer Science 2021-07-27 Brecht Vandevoort , Bas Ketsman , Christoph Koch , Frank Neven

This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations…

Logic in Computer Science · Computer Science 2015-07-01 François Laroussinie , Antoine Meyer , Eudes Petonnet
‹ Prev 1 2 3 10 Next ›