scientific article; zbMATH DE number 3189696
From MaRDI portal
Publication:5725991
zbMath0116.33604MaRDI QIDQ5725991
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items
Effective Synthesis of Asynchronous Systems from GR(1) Specifications, The computational complexity of scenario-based agent verification and design, Graph Games and Reactive Synthesis, Synthesis with rational environments, Compositional and symbolic synthesis of reactive controllers for multi-agent systems, Supervision based on place invariants: a survey, On Distributed Monitoring and Synthesis, Optimal paths in weighted timed automata, Choice functions and well-orderings over the infinite binary tree, Randomization in Automata on Infinite Trees, Fairness, assumptions, and guarantees for extended bounded response \textsf{LTL+P} synthesis, Synchronous counting and computational algorithm design, Automata over continuous time, Supervisory control and reactive synthesis: a comparative introduction, A survey of stochastic \(\omega \)-regular games, Finding and fixing faults, Decidability of well-connectedness for distributed synthesis, Distributed Synthesis for Alternating-Time Logics, Synthesizing Non-Vacuous Systems, Unnamed Item, Unnamed Item, Unnamed Item, Towards a notion of unsatisfiable and unrealizable cores for LTL, Synthesis of Reactive(1) designs, Synthesis from scenario-based specifications, Unnamed Item, Distributed synthesis is simply undecidable, Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets, On Synthesis of Specifications with Arithmetic, Combinations of Qualitative Winning for Stochastic Parity Games, Fine hierarchies and m-reducibilities in theoretical computer science, Synthesis of deterministic top-down tree transducers from automatic tree relations, Strategy synthesis for multi-dimensional quantitative objectives, Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\), The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates, Unnamed Item, Unnamed Item, Playing with Repetitions in Data Words Using Energy Games, Counting branches in trees using games, From Logic to Theoretical Computer Science – An Update, Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey, Church’s Problem and a Tour through Automata Theory, From Monadic Logic to PSL, Facets of Synthesis: Revisiting Church’s Problem, Vacuity in synthesis, Decidable Extensions of Church’s Problem, Measuring and Synthesizing Systems in Probabilistic Environments, Unnamed Item, Compositional construction of most general controllers, Synthesis of succinct systems
