English
Related papers

Related papers: A Game-theoretic Approach for Synthesizing Fault-T…

200 papers

We consider the synthesis of distributed implementations for specifications in Prompt Linear Temporal Logic (PROMPT-LTL), which extends LTL by temporal operators equipped with parameters that bound their scope. For single process synthesis…

Logic in Computer Science · Computer Science 2016-09-15 Swen Jacobs , Leander Tentrup , Martin Zimmermann

The increasing prevalence of security attacks on software-intensive systems calls for new, effective methods for detecting and responding to these attacks. As one promising approach, game theory provides analytical tools for modeling the…

Software Engineering · Computer Science 2021-12-15 Mingyue Zhang , Nianyu Li , Sridhar Adepu , Eunsuk Kang , Zhi Jin

We propose a machine learning framework to synthesize reactive controllers for systems whose interactions with their adversarial environment are modeled by infinite-duration, two-player games over (potentially) infinite graphs. Our…

Computer Science and Game Theory · Computer Science 2020-11-03 Daniel Neider , Oliver Markgraf

We present a novel method to compute \emph{permissive winning strategies} in two-player games over finite graphs with $ \omega $-regular winning conditions. Given a game graph $G$ and a parity winning condition $\Phi$, we compute a…

Computer Science and Game Theory · Computer Science 2024-01-23 Ashwani Anand , Satya Prakash Nayak , Anne-Kathrin Schmuck

We present a framework that takes a concurrent program composed of unsynchronized processes, along with a temporal specification of their global concurrent behaviour, and automatically generates a concurrent program with synchronization…

Logic in Computer Science · Computer Science 2012-07-05 Roopsha Samanta

In this paper we present an assume-guarantee specification theory (aka interface theory from [14]) for modular synthesis and verification of real-time systems with critical timing constraints. It is a further step of our earlier work [10]…

Logic in Computer Science · Computer Science 2013-04-30 Chris Chilton , Marta Kwiatkowska , Xu Wang

There are many distributed systems which use a leader in their logic. When such systems need to be fault tolerant and the current leader suffers a technical problem, it is necesary to apply a special algorithm in order to choose a new…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-03-08 Marius Rafailescu

We introduce transductive program synthesis, a new formulation of the program synthesis task that explicitly leverages test inputs during synthesis. While prior approaches to program synthesis--whether based on natural language descriptions…

Artificial Intelligence · Computer Science 2025-10-22 Kang-il Lee , Jahyun Koo , Seunghyun Yoon , Minbeom Kim , Hyukhun Koh , Dongryeol Lee , Kyomin Jung

This paper continues to develop a fault tolerant extension of the sparse grid combination technique recently proposed in [B. Harding and M. Hegland, ANZIAM J., 54 (CTAC2012), pp. C394-C411]. The approach is novel for two reasons, first it…

Numerical Analysis · Mathematics 2014-04-11 Brendan Harding , Markus Hegland , Jay Larson , James Southern

Supercomputing systems today often come in the form of large numbers of commodity systems linked together into a computing cluster. These systems, like any distributed system, can have large numbers of independent hardware components…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Michael Treaster

Hybrid games are games played on a finite graph endowed with real variables which may model behaviors of discrete controllers of continuous systems. The synthesis problem for hybrid games is decidable for classical objectives (like LTL…

Logic in Computer Science · Computer Science 2024-10-01 Catalin Dima , Mariem Hammami , Youssouf Oualhadj , Régine Laleau

Reliability and availability analysis are essential in dependable critical embedded systems. The classical implementation of dependability for an embedded system relies on merging both fundamental structures with the required dependability…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-14 Mahmoud I. Banat , Belal H. Sababha , Sami Al-Hamdan

We study discounted infinitely repeated games in which players agree on a cooperative mixed action profile but, at each step, observe only the realized pure actions. This form of imperfect monitoring breaks classical trigger strategies,…

Applications · Statistics 2026-03-09 Aymeric Capitaine , Antoine Scheid , Etienne Boursier , Alain Durmus , Michael I. Jordan

We extend the quantitative synthesis framework by going beyond the worst-case. On the one hand, classical analysis of two-player games involves an adversary (modeling the environment of the system) which is purely antagonistic and asks for…

Computer Science and Game Theory · Computer Science 2015-11-02 Véronique Bruyère , Emmanuel Filiot , Mickael Randour , Jean-François Raskin

Today's hardware technology presents a new challenge in designing robust systems. Deep submicron VLSI technology introduced transient and permanent faults that were never considered in low-level system designs in the past. Still, robustness…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-19 Danny Dolev , Matthias Fuegger , Christoph Lenzen , Ulrich Schmid

We provide a learning-based technique for guessing a winning strategy in a parity game originating from an LTL synthesis problem. A cheaply obtained guess can be useful in several applications. Not only can the guessed strategy be applied…

Artificial Intelligence · Computer Science 2023-05-25 Jan Kretinsky , Tobias Meggendorfer , Maximilian Prokop , Sabine Rieder

Environmental noise (e.g.heat, ionized particles, etc.) causes transient faults in hardware, which lead to corruption of stored values. Mission-critical devices require such faults to be mitigated by fault-tolerance --- a combination of…

Cryptography and Security · Computer Science 2014-10-28 Filippo Del Tedesco , David Sands , Alejandro Russo

Classical reactive synthesis approaches aim to synthesize a reactive system that always satisfies a given specifications. These approaches often reduce to playing a two-player zero-sum game where the goal is to synthesize a winning…

Computer Science and Game Theory · Computer Science 2025-06-09 Karan Muvvala , Qi Heng Ho , Morteza Lahijanian

We study a variant of LTLf synthesis that synthesizes adaptive strategies for achieving a multi-tier goal, consisting of multiple increasingly challenging LTLf objectives in nondeterministic planning domains. Adaptive strategies are…

Artificial Intelligence · Computer Science 2025-04-30 Giuseppe De Giacomo , Gianmarco Parretti , Shufang Zhu

In dynamic systems that adapt to users' needs and changing environments, dependability needs cannot be avoided. This paper proposes an orthogonal fault tolerance model as a means to manage and reason about multiple fault tolerance…

Software Engineering · Computer Science 2014-04-29 Sobia K Khan