Church synthesis on register automata over linearly ordered data domains
From MaRDI portal
Publication:6151760
DOI10.1007/s10703-023-00435-warXiv2004.12141OpenAlexW3118758710MaRDI QIDQ6151760
Emmanuel Filiot, Léo Exibard, Ayrat Khalimov
Publication date: 11 March 2024
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.12141
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak MSO with the unbounding quantifier
- An automata-theoretic approach to constraint LTL
- Finite-memory automata
- Automatic verification of recursive procedures with one integer parameter.
- Automata, logics, and infinite games. A guide to current research
- Parameterized synthesis for fragments of first-order logic over data words
- Decidable synthesis of programs with uninterpreted functions
- Satisfiability of CTL* with Constraints
- Synthesis with Identifiers
- LTL with the freeze quantifier and register automata
- Graph Games and Reactive Synthesis
- On Synthesis of Specifications with Arithmetic
- Playing with Repetitions in Data Words Using Energy Games
- Facets of Synthesis: Revisiting Church’s Problem
- Two-Way Tree Automata Solving Pushdown Games
- Infinite-state energy games
- Deciding parity games in quasipolynomial time
- Weak MSO+U with Path Quantifiers over Infinite Trees
- Parameterized Verification of Broadcast Networks of Register Automata
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Computer Science Logic
- Rewriting Systems with Data
- Solving Sequential Conditions by Finite-State Strategies
- Two-Variable Logic with Two Order Relations
- Foundations of Software Science and Computation Structures
- Bounded synthesis of register transducers
This page was built for publication: Church synthesis on register automata over linearly ordered data domains
