Cover Image

Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barbot, Benoît, Busatto-Gaston, Damien, Dima, Catalin, Oualhadj, Youssouf
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Arena-Independent Finite-Memory Determinacy in Stochastic Games
by: Bouyer, Patricia, et al.
Published: (2021)

Half-Positional Objectives Recognized by Deterministic Büchi Automata
by: Bouyer, Patricia, et al.
Published: (2022)

Fairness and promptness in Muller formulas
by: Busatto-Gaston, Damien, et al.
Published: (2022)

Deciding the synthesis problem for hybrid games through bisimulation
by: Dima, Catalin, et al.
Published: (2024)

Synthesis of Robust Optimal Strategies in Weighted Timed Games
by: Monmege, Benjamin, et al.
Published: (2024)

Clone-Robust Weights in Metric Spaces: Handling Redundancy Bias for Benchmark Aggregation
by: Berriaud, Damien, et al.
Published: (2025)

Breaking the Illusion of Artificial Consensus: Clone-Robust Weighting for Arbitrary Metric Spaces
by: Berriaud, Damien, et al.
Published: (2026)

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
by: Nayak, Satya Prakash, et al.
Published: (2022)

Games on Graphs: From Logic and Automata to Algorithms
by: Fijalkow, Nathanaël, et al.
Published: (2023)

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata
by: Fernau, Henning, et al.
Published: (2024)

An Automata-Based Approach to Games with $ω$-Automatic Preferences
by: Bruyère, Véronique, et al.
Published: (2026)

Distributional Robustness of Linear Contracts
by: Zuo, Shiliang
Published: (2026)

Near-Optimal Dropout-Robust Sortition
by: Gambhir, Maya Pal, et al.
Published: (2025)

Computing Adequately Permissive Assumptions for Synthesis
by: Anand, Ashwani, et al.
Published: (2023)

TimeBoost: Do Ahead-of-Time Auctions Work?
by: Mamageishvili, Akaki, et al.
Published: (2025)

Job-Scheduling Games with Time-Dependent Processing Times
by: Borenstein, Ido, et al.
Published: (2026)

Robustness of voting mechanisms to external information in expectation
by: Chen, Yiling, et al.
Published: (2024)

Robust Committee Voting, or The Other Side of Representation
by: Kehne, Gregory, et al.
Published: (2025)

Robust Resource Allocation via Competitive Subsidies
by: Lin, David X., et al.
Published: (2025)

Robust Stable Matchings: Dealing with Changes in Preferences
by: Gangam, Rohith Reddy, et al.
Published: (2026)

Robust Temporal Guarantees in Budgeted Sequential Auctions
by: Fikioris, Giannis, et al.
Published: (2026)

Anonymous and Copy-Robust Delegations for Liquid Democracy
by: Utke, Markus, et al.
Published: (2023)

Just-in-Time Resale in an Ahead-of-Time Auction: An Event Study
by: Öz, Burak, et al.
Published: (2026)

Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
by: Brihaye, Thomas, et al.
Published: (2023)

Intrinsic Robustness of Prophet Inequality to Strategic Reward Signaling
by: Tang, Wei, et al.
Published: (2024)

On Robustness to $k$-wise Independence of Optimal Bayesian Mechanisms
by: Gravin, Nick, et al.
Published: (2024)

The Complexity of Computing Robust Mediated Equilibria in Ordinal Games
by: Conitzer, Vincent
Published: (2024)

Distributionally Robust Games via Coherent Risk Measures
by: Gangwani, Bharat, et al.
Published: (2026)

Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals
by: Leme, Renato Paes, et al.
Published: (2023)

Guarding Against Malicious Biased Threats (GAMBiT): Experimental Design of Cognitive Sensors and Triggers with Behavioral Impact Analysis
by: Beltz, Brandon, et al.
Published: (2025)

Algorithms and Analysis for Optimizing Robust Objectives in Fair Machine Learning
by: Cousins, Cyrus
Published: (2024)

Robust Information Design with Heterogeneous Beliefs in Bayesian Congestion Games
by: Hu, Yuwei, et al.
Published: (2026)

Robustness of Stable Matchings When Attributes and Salience Determine Preferences
by: Ronen, Amit, et al.
Published: (2026)

Characterizing Robustness of Strategies to Novelty in Zero-Sum Open Worlds
by: Kejriwal, Mayank, et al.
Published: (2026)

Black-Box Lifting and Robustness Theorems for Multi-Agent Contracts
by: Dütting, Paul, et al.
Published: (2025)

Convergence of Fast Policy Iteration in Markov Games and Robust MDPs
by: Badger, Keith, et al.
Published: (2025)

Most General Winning Secure Equilibria Synthesis in Graph Games
by: Nayak, Satya Prakash, et al.
Published: (2024)

Contract-Based Distributed Synthesis in Two-Objective Parity Games
by: Anand, Ashwani, et al.
Published: (2023)

Incremental Data-Driven Policy Synthesis via Game Abstractions
by: Sağlam, Irmak, et al.
Published: (2025)

Worst- and Average-Case Robustness of Stable Matchings: (Counting) Complexity and Experiments
by: Boehmer, Kimon, et al.
Published: (2024)