scientific article; zbMATH DE number 7649933

DOI10.4230/LIPIcs.CONCUR.2019.25MaRDI QIDQ5875386

Orna Kupferman, Ayrat Khalimov

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

synthesisregister automataregister transducers

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

On computability of data word functions defined by transducers, On Synthesis of Specifications with Arithmetic, Synthesis of Data Word Transducers, Unnamed Item

Cites Work

• Finite-memory automata
• Finite-state unification automata and relational languages
• Automatic verification of recursive procedures with one integer parameter.
• Determinising Parity Automata
• Synthesis with Identifiers
• LTL with the freeze quantifier and register automata
• Graph Games and Reactive Synthesis
• Two-variable logic on data trees and XML reasoning
• Bounded Synthesis
• Environment Assumptions for Synthesis
• Variable Automata over Infinite Alphabets
• An Antichain Algorithm for LTL Realizability
• Deciding parity games in quasipolynomial time
• An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications
• Parameterized Verification of Broadcast Networks of Register Automata
• Fresh-register automata
• Rewriting Systems with Data
• Synthesis of Data Word Transducers
• Bounded synthesis of register transducers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item