English
Related papers

Related papers: Coefficient Synthesis for Threshold Automata

200 papers

We present an approach to automatically synthesize synchronized models from lightweight formal specifications. Our approach takes as input a specification of a distributed system along with a global linear time constraint, which must be…

Software Engineering · Computer Science 2025-02-20 Pablo F. Castro , Luciano Putruele , Renzo Degiovanni , Nazareno Aguirre

The main purpose of Feature Subset Selection is to find a reduced subset of attributes from a data set described by a feature set. The task of a feature selection algorithm (FSA) is to provide with a computational solution motivated by a…

Artificial Intelligence · Computer Science 2015-03-17 L. A. Belanche , F. F. González

We consider the problem of designing distributed controllers to guarantee dissipativity of a networked system comprised of dynamically coupled subsystems. We require that the control synthesis is carried out locally at the subsystem-level,…

Systems and Control · Computer Science 2020-04-30 Etika Agarwal , S. Sivaranjani , Vijay Gupta , Panos Antsaklis

We study the problem of synthesizing a controller to satisfy a complex task in the presence of sensor faults and attacks. We model the task using Gaussian distribution temporal logic (GDTL), and propose a solution approach that does not…

Systems and Control · Electrical Eng. & Systems 2022-08-23 Luyao Niu , Zhouchi Li , Andrew Clark

In this paper, we provide a compositional framework for synthesizing hybrid controllers for interconnected discrete-time control systems enforcing specifications expressed by co-Buchi automata. In particular, we first decompose the given…

Systems and Control · Electrical Eng. & Systems 2020-02-04 Pushpak Jagtap , Abdalla Swikir , Majid Zamani

The question if a deterministic finite automaton admits a software reset in the form of a so-called synchronizing word can be answered in polynomial time. In this paper, we extend this algorithmic question to deterministic automata beyond…

Formal Languages and Automata Theory · Computer Science 2020-12-23 Henning Fernau , Petra Wolf , Tomoyuki Yamakami

Techniques to deliver privacy-preserving synthetic datasets take a sensitive dataset as input and produce a similar dataset as output while maintaining differential privacy. These approaches have the potential to improve data sharing and…

Databases · Computer Science 2018-08-24 Luke Rodriguez , Bill Howe

Specification synthesis is the process of deriving a model from the input-output traces of a system. It is used extensively in test design, reverse engineering, and system identification. One type of the resulting artifact of this process…

Formal Languages and Automata Theory · Computer Science 2021-01-19 Iman Saberi , Fathiyeh Faghih , Farzad Sobhi Bavil

In this paper we investigate the problem of learning an unknown bounded function. We be emphasize special cases where it is possible to provide very simple (in terms of computation) estimates enjoying in addition the property of being…

Statistics Theory · Mathematics 2007-06-13 Gerard Kerkyacharian , Dominique Picard

Backward stability is a desirable property for a well-designed numerical algorithm: given an input, a backward stable floating-point program produces the exact output for a nearby input. While automated tools for bounding the forward error…

Programming Languages · Computer Science 2026-04-20 Laura Zielinski , Justin Hsu

In this paper, we investigate the performance analysis and synthesis of distributed system throttlers (DST). A throttler is a mechanism that limits the flow rate of incoming metrics, e.g., byte per second, network bandwidth usage, capacity,…

Systems and Control · Computer Science 2017-06-30 Milad Siami , Joëlle Skaf

A workflow specification defines a set of steps and the order in which those steps must be executed. Security requirements may impose constraints on which groups of users are permitted to perform subsets of those steps. A workflow…

Cryptography and Security · Computer Science 2013-01-10 Jason Crampton , Gregory Gutin , Anders Yeo

We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automata and transducers. They extend finite-state automata by…

Formal Languages and Automata Theory · Computer Science 2022-05-23 Léo Exibard , Emmanuel Filiot , Ayrat Khalimov

This paper considers the problem of completing a rating matrix based on sub-sampled matrix entries as well as observed social graphs and hypergraphs. We show that there exists a \emph{sharp threshold} on the sample probability for the task…

Machine Learning · Computer Science 2026-05-29 Zhongtian Ma , Qiaosheng Zhang , Zhen Wang

We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automata and transducers. They extend finite-state automata by…

Formal Languages and Automata Theory · Computer Science 2022-06-09 Léo Exibard , Emmanuel Filiot , Ayrat Khalimov

Shared resources synchronization is a well studied problem, in both shared memory environment or distributed memory environment. Many synchronization mechanisms are proposed, with their own way to reach certain consistency level. This…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-02-21 Chih-Wei Chien , Chi-Yeh Chen

In this paper, we consider the problem of controller design using approximately bisimilar abstractions with an emphasis on safety and reachability specifications. We propose abstraction-based approaches to solve both classes of problems. We…

Systems and Control · Computer Science 2011-06-17 Antoine Girard

We present a new method for the automated synthesis of digital controllers with formal safety guarantees for systems with nonlinear dynamics, noisy output measurements, and stochastic disturbances. Our method derives digital controllers…

Systems and Control · Electrical Eng. & Systems 2019-08-21 Fedor Shmarov , Sadegh Soudjani , Nicola Paoletti , Ezio Bartocci , Shan Lin , Scott A. Smolka , Paolo Zuliani

Runtime monitors assess whether a system is in an unsafe state based on a stream of observations. We study the problem where the system is subject to probabilistic uncertainty and described by a hidden Markov model. A stream of observations…

Formal Languages and Automata Theory · Computer Science 2025-09-22 Luko van der Maas , Sebastian Junges

In this paper, adapted from the author's PhD thesis, we present otherwise unpublished results relating to global control schemes, culminating in the calculation of a fault-tolerant threshold for one such scheme. As with early fault-tolerant…

Quantum Physics · Physics 2007-05-23 Alastair Kay