English
Related papers

Related papers: Sound Conflict Analysis for Timed Contract Automat…

200 papers

We introduce a deep learning model for speech denoising, a long-standing challenge in audio analysis arising in numerous applications. Our approach is based on a key observation about human speech: there is often a short pause between each…

Sound · Computer Science 2020-10-26 Ruilin Xu , Rundi Wu , Yuko Ishiwaka , Carl Vondrick , Changxi Zheng

The reliability of autonomous systems depends on their robustness, i.e., their ability to meet their objectives under uncertainty. In this paper, we study spatiotemporal robustness of temporal logic specifications evaluated over…

Artificial Intelligence · Computer Science 2026-05-19 Oliver Schön , Lars Lindemann

Partial observability and controllability are two well-known issues in test-case synthesis for interactive systems. We address the problem of partial control in the synthesis of test cases from timed-automata specifications. Building on the…

Formal Languages and Automata Theory · Computer Science 2018-05-04 Léo Henry , Thierry Jéron , Nicolas Markey

An approach to the formal description of service contracts is presented in terms of automata. We focus on the basic property of guaranteeing that in the multi-party composition of principals each of them gets his requests satisfied, so that…

Logic in Computer Science · Computer Science 2023-06-22 Davide Basile , Pierpaolo Degano , Gian-Luigi Ferrari

Temporal reasoning with conditionals is more complex than both classical temporal reasoning and reasoning with timeless conditionals, and can lead to some rather counter-intuitive conclusions. For instance, Aristotle's famous "Sea Battle…

Logic in Computer Science · Computer Science 2024-05-28 Fengkui Ju , Gianluca Grilletti , Valentin Goranko

The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and…

Logic in Computer Science · Computer Science 2018-08-16 Laura Bozzelli , Aniello Murano , Adriano Peron

A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations…

Logic in Computer Science · Computer Science 2007-05-23 Slawomir Lasota , Igor Walukiewicz

Session types, types for structuring communication between endpoints in distributed systems, are recently being integrated into mainstream programming languages. In practice, a very important notion for dealing with such types is that of…

Programming Languages · Computer Science 2023-06-22 Mario Bravetti , Marco Carbone , Julien Lange , Nobuko Yoshida , Gianluigi Zavattaro

Contracts underlie most modern commercial transactions defining define the duties and obligations of the related parties in an agreement. Ensuring such agreements are error free is crucial for modern society and their analysis of a contract…

Artificial Intelligence · Computer Science 2021-11-04 Alexandre Yukio Ichida , Felipe Meneguzzi

We study the problem of online learning in competitive settings in the context of two-sided matching markets. In particular, one side of the market, the agents, must learn about their preferences over the other side, the firms, through…

Artificial Intelligence · Computer Science 2022-06-07 Chinmay Maheshwari , Eric Mazumdar , Shankar Sastry

Verification of temporal logic properties plays a crucial role in proving the desired behaviors of hybrid systems. In this paper, we propose an interval method for verifying the properties described by a bounded linear temporal logic. We…

Logic in Computer Science · Computer Science 2015-07-15 Daisuke Ishii , Naoki Yonezaki , Alexandre Goldsztejn

The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and…

Logic in Computer Science · Computer Science 2019-11-20 Laura Bozzelli , Aniello Murano , Adriano Peron

Control synthesis from temporal logic specifications has gained popularity in recent years. In this paper, we use a model predictive approach to control discrete time linear systems with additive bounded disturbances subject to constraints…

Systems and Control · Computer Science 2016-05-24 Sadra Sadraddini , Calin Belta

We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so under a different perspective, that is, we consider a dynamic…

Formal Languages and Automata Theory · Computer Science 2020-02-18 Alejandro Grez , Filip Mazowiecki , Michał Pilipczuk , Gabriele Puppis , Cristian Riveros

Runtime analysis aims at contributing to our understanding of evolutionary algorithms through mathematical analyses of their runtimes. In the context of discrete optimization problems, runtime analysis classically studies the time needed to…

Neural and Evolutionary Computing · Computer Science 2022-06-17 Maxim Buzdalov , Benjamin Doerr , Carola Doerr , Dmitry Vinokurov

The paper studies defeasible reasoning in rule-based systems, in particular about legal norms and contracts. We identify rule modifiers that specify how rules interact and how they can be overridden. We then define rule transformations that…

Artificial Intelligence · Computer Science 2022-05-17 How Khang Lim , Avishkar Mahajan , Martin Strecker , Meng Weng Wong

Deontic logic is a very well researched branch of mathematical logic and philosophy. Various kinds of deontic logics are considered for different application domains like argumentation theory, legal reasoning, and acts in multi-agent…

Artificial Intelligence · Computer Science 2015-02-23 Ulrich Furbach , Claudia Schon , Frieder Stolzenburg

We consider temporal logic verification of (possibly nonlinear) dynamical systems evolving over continuous state spaces. Our approach combines automata-based verification and the use of so-called barrier certificates. Automata-based…

Formal Languages and Automata Theory · Computer Science 2014-03-17 Tichakorn Wongpiromsarn , Ufuk Topcu , Andrew Lamperski

This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability (or undecidability) results,…

Logic in Computer Science · Computer Science 2013-08-06 Savas Konur

Contextual bandit algorithms are sensitive to the estimation method of the outcome model as well as the exploration method used, particularly in the presence of rich heterogeneity or complex outcome models, which can lead to difficult…

Machine Learning · Computer Science 2018-12-18 Maria Dimakopoulou , Zhengyuan Zhou , Susan Athey , Guido Imbens