English
Related papers

Related papers: Minimal Assumptions Refinement for GR(1) Specifica…

200 papers

Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems often interact with other systems, or agents. Many times these agents have…

Logic in Computer Science · Computer Science 2009-07-20 Dana Fisman , Orna Kupferman , Yoad Lustig

Performative prediction is a framework accounting for the shift in the data distribution induced by the prediction of a model deployed in the real world. Ensuring rapid convergence to a stable solution where the data distribution remains…

Machine Learning · Computer Science 2026-01-30 Pedram Khorsandi , Rushil Gupta , Mehrnaz Mofakhami , Simon Lacoste-Julien , Gauthier Gidel

Refinement transforms an abstract system model into a concrete, executable program, such that properties established for the abstract model carry over to the concrete implementation. Refinement has been used successfully in the development…

Logic in Computer Science · Computer Science 2021-10-27 Aurel Bílý , Christoph Matheja , Peter Müller

Virtually all verification techniques using formal methods rely on the availability of a formal specification, which describes the design requirements precisely. However, formulating specifications remains a manual task that is notoriously…

Formal Languages and Automata Theory · Computer Science 2025-01-28 Daniel Neider , Rajarshi Roy

We present a modular approach to \emph{reinforcement learning} (RL) in environments consisting of simpler components evolving in parallel. A monolithic view of such modular environments may be prohibitively large to learn, or may require…

Machine Learning · Computer Science 2023-12-18 Milad Kazemi , Mateo Perez , Fabio Somenzi , Sadegh Soudjani , Ashutosh Trivedi , Alvaro Velasquez

In this study, we address the challenge of learning generalizable policies for compositional tasks defined by logical specifications. These tasks consist of multiple temporally extended sub-tasks. Due to the sub-task inter-dependencies and…

Artificial Intelligence · Computer Science 2024-11-05 Duo Xu , Faramarz Fekri

In this paper, we introduce a novel rule for synthesis of reactive systems, applicable to systems made of n components which have each their own objectives. It is based on the notion of admissible strategies. We compare our novel rule with…

Logic in Computer Science · Computer Science 2015-07-03 Romain Brenguier , Jean-François Raskin , Ocan Sankur

Runtime verification is an effective automated method for specification-based offline testing and analysis as well as online monitoring of complex systems. The specification language is often a variant of regular expressions or a popular…

Logic in Computer Science · Computer Science 2014-11-11 Ramy Medhat , Yogi Joshi , Borzoo Bonakdarpour , Sebastian Fischmeister

We present a compositional approach to controller synthesis of discrete event system controllers with linear temporal logic (LTL) goals. We exploit the modular structure of the plant to be controlled, given as a set of labelled transition…

Software Engineering · Computer Science 2025-11-06 Hernan Gagliardi , Victor Braberman , Sebastian Uchitel

Experimental designs reflect assumptions about variable relationships that determine what causal queries researchers can answer through the experiment. Accounting for and communicating these assumptions is essential for drawing valid,…

Human-Computer Interaction · Computer Science 2026-04-15 London Bielicke , Anna Zhang , Shruti Tyagi , Emery Berger , Adam Chlipala , Eunice Jun

Logic synthesis, a pivotal stage in chip design, entails optimizing chip specifications encoded in hardware description languages like Verilog into highly efficient implementations using Boolean logic gates. The process involves a…

Machine Learning · Computer Science 2024-01-23 Animesh Basak Chowdhury , Marco Romanelli , Benjamin Tan , Ramesh Karri , Siddharth Garg

While reachability analysis is one of the most promising approaches for formal verification of dynamic systems, a major disadvantage preventing a more widespread application is the requirement to manually tune algorithm parameters such as…

Logic in Computer Science · Computer Science 2024-04-09 Niklas Kochdumper , Stanley Bak

This paper addresses the problem of creating simplifiers for logic formulas based on conditional term rewriting. In particular, the paper focuses on a program synthesis application where formula simplifications have been shown to have a…

Programming Languages · Computer Science 2016-02-24 Rohit Singh , Armando Solar-Lezama

We study automated test generation for verifying discrete decision-making modules in autonomous systems. We utilize linear temporal logic to encode the requirements on the system under test in the system specification and the behavior that…

Reactive synthesis is a paradigm for automatically building correct-by-construction systems that interact with an unknown or adversarial environment. We study how to do reactive synthesis when part of the specification of the system is that…

Logic in Computer Science · Computer Science 2018-04-23 Daniel J. Fremont , Sanjit A. Seshia

We revisit the problem of reducing incompletely specified Mealy machines with reactive synthesis in mind. We propose two techniques: the former is inspired by the tool MeMin and solves the minimization problem, the latter is a novel…

Formal Languages and Automata Theory · Computer Science 2022-06-22 Florian Renkin , Philipp Schlehuber-Caissier , Alexandre Duret-Lutz , Adrien Pommellet

We have witnessed the emergence of several controller parameterizations and the corresponding synthesis methods, including Youla, system level, input-output, and many other new proposals. Meanwhile, under the same synthesis method, there…

Optimization and Control · Mathematics 2022-02-11 Shih-Hao Tseng

Timed regular expressions serve as a formalism for specifying real-time behaviors of Cyber-Physical Systems. In this paper, we consider the synthesis of timed regular expressions, focusing on generating a timed regular expression consistent…

Formal Languages and Automata Theory · Computer Science 2025-09-12 Ziran Wang , Jie An , Naijun Zhan , Miaomiao Zhang , Zhenya Zhang

We consider the setting of component-based design for real-time systems with critical timing constraints. Based on our earlier work, we propose a compositional specification theory for timed automata with I/O distinction, which supports…

Software Engineering · Computer Science 2012-06-21 Chris Chilton , Marta Kwiatkowska , Xu Wang

In reactive controller synthesis, a number of implementations (controllers) are possible for a given specification because of the incomplete nature of specification. To choose the most desirable one from the various options, we need to…

Logic in Computer Science · Computer Science 2019-05-28 Amol Wakankar , Paritosh K. Pandya , Rajmohan Matteplackel
‹ Prev 1 4 5 6 7 8 10 Next ›