Image de couverture de livre

One-clock synthesis problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lasota, Sławomir, Lehaut, Mathieu, Parreaux, Julie, Piórkowski, Radosław
Format:	Preprint
Publié:	2026
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Adding Reconfiguration to Zielonka's Asynchronous Automata
par: Lehaut, Mathieu, et autres
Publié: (2023)

Reachability in symmetric VASS
par: Kamiński, Łukasz, et autres
Publié: (2025)

From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
par: Lehaut, Mathieu, et autres
Publié: (2026)

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
par: Hausmann, Daniel, et autres
Publié: (2024)

Bi-reachability in Petri nets with data
par: Kamiński, Łukasz, et autres
Publié: (2024)

Separability and Non-Determinizability of WSTS
par: Czerwiński, Wojciech, et autres
Publié: (2023)

Execution-time opacity problems in one-clock parametric timed automata
par: André, Étienne, et autres
Publié: (2024)

Solvability of orbit-finite systems of linear equations
par: Ghosh, Arka, et autres
Publié: (2022)

Reachability in 3-VASS is Elementary
par: Czerwiński, Wojciech, et autres
Publié: (2025)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
par: Guttenberg, Roland, et autres
Publié: (2025)

Global One-Counter Tree Automata
par: Herrmann, Luisa, et autres
Publié: (2024)

Two-Way One-Counter Nets Revisited
par: Almagor, Shaull, et autres
Publié: (2024)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
par: Bizière, Clotilde, et autres
Publié: (2024)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
par: Lacroce, Clara, et autres
Publié: (2023)

The complexity of reachability problems in strongly connected finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
par: Chen, Zeyu, et autres
Publié: (2026)

Learning specifications for reactive synthesis with safety constraints
par: Watanabe, Kandai, et autres
Publié: (2026)

Quantum finite automata and linear context-free languages: a decidable problem
par: Bertoni, A., et autres
Publié: (2013)

Deciding the synthesis problem for hybrid games through bisimulation
par: Dima, Catalin, et autres
Publié: (2024)

Non-cooperative rational synthesis problem for probabilistic strategies
par: Koide, So, et autres
Publié: (2024)

Equivariant ideals of polynomials
par: Ghosh, Arka, et autres
Publié: (2024)

Infinite-state Games with Energy Objectives Beyond Counters
par: Sağlam, Irmak, et autres
Publié: (2026)

Nondeterministic state complexity of square root
par: Onishchenko, Sergey
Publié: (2026)

Forgetting Event Order in Higher-Dimensional Automata
par: Zouari, Safa
Publié: (2026)

Exact Accepting-State Spectrum for Reversal of Permutation Automata
par: German, Samuel
Publié: (2026)

Temporal Causal Models as a Model of Computation
par: Gladyshev, Maksim, et autres
Publié: (2026)

The Similarity Control Problem with Required Events
par: Wang, Yu, et autres
Publié: (2026)

History-Deterministic Büchi Automata are Succinct
par: Casares, Antonio, et autres
Publié: (2026)

Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata
par: Erlich, Enzo, et autres
Publié: (2026)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
par: Kostolányi, Peter, et autres
Publié: (2026)

Localising Stochasticity in Weighted Automata
par: Agarwal, Smayan, et autres
Publié: (2026)

A quadratic lower bound for 2DFAs against one-way liveness
par: Adeogun, Kehinde, et autres
Publié: (2026)

History-Constrained Systems
par: Kuijer, Louwe B., et autres
Publié: (2026)

AGDES: Automatic Generation of Dependent Event Sequences
par: Guzman, Alexander Obeid
Publié: (2026)

Minimizing Streaming String Transducers: An algebraic approach
par: Benalioua, Yahia Idriss, et autres
Publié: (2026)

Forbidden-Context & Ordered Grammar Systems
par: Fernau, Henning, et autres
Publié: (2026)

Active Inference of Extended Finite State Machine Models with Registers and Guards
par: Groz, Roland, et autres
Publié: (2026)

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
par: Shoudai, Takayoshi, et autres
Publié: (2026)

Shuffles of Context-Free Languages along Regular Trajectories
par: Barloy, Corentin, et autres
Publié: (2026)

Formalized Run-Time Analysis of Active Learning -- Coalgebraically in Agda
par: Wißmann, Thorsten
Publié: (2026)