Synthesis of Asynchronous Systems
From MaRDI portal
Publication:3591079
DOI10.1007/978-3-540-71410-1_10zbMath1196.68142OpenAlexW1490247810MaRDI QIDQ3591079
Publication date: 10 September 2007
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71410-1_10
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Effective Synthesis of Asynchronous Systems from GR(1) Specifications, Symmetric Strategy Improvement, Distributed synthesis for well-connected architectures, Graph Games and Reactive Synthesis, From Parity and Payoff Games to Linear Programming, Solving parity games in big steps, Controlling loosely cooperating processes, Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games, Unnamed Item, Symbolic bounded synthesis, Encodings of Bounded Synthesis, Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems, Distributed synthesis for parameterized temporal logics, Solving Parity Games in Big Steps, Synthesis from hyperproperties
