Reactive synthesis from visibly register pushdown automata
From MaRDI portal
Publication:2119985
DOI10.1007/978-3-030-85315-0_19OpenAlexW3195614614MaRDI QIDQ2119985
Ryoma Senda, Yoshiaki Takata, Hiroyuki Seki
Publication date: 31 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85315-0_19
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Finite-memory automata
- Context-free languages over infinite alphabets
- Complexity results on register context-free grammars and register tree automata
- A logical characterization of data languages.
- Pushdown processes: Games and model-checking
- Model checking LTL with regular valuations for pushdown systems
- Generalized register context-free grammars
- Regular expressions for data words
- Reachability in pushdown register automata
- Well-Structured Pushdown Systems
- Automata theory in nominal sets
- Regular Expressions for Data Words
- Model Checking Languages of Data Words
- Pushdown Model Checking for Malware Detection
- Synthesis with Identifiers
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- Graph Games and Reactive Synthesis
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Finite state machines for strings over infinite alphabets
- Fresh-register automata
- Solving Sequential Conditions by Finite-State Strategies
- A Note on Pushdown Store Automata and Regular Systems
- Reachability analysis of pushdown automata: Application to model-checking
- Bounded synthesis of register transducers
- Symbolic register automata
This page was built for publication: Reactive synthesis from visibly register pushdown automata
