On the Synthesis of an Asynchronous Reactive Module
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Synthesis from Knowledge-Based Specifications (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Synthesizing Processes and Schedulers from Temporal Specifications
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing
Reasoning About Knowledge
Synthesis of distributed systems from knowledge-based specifications
CONCUR 2005 - Concurrency Theory
Strategy Construction for Parity Games with Imperfect Information
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Timed control with observation based and stuttering invariant strategies
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
| Hi-index | 0.00 |
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a general model, a standard synchronous and an asynchronous one. In the asynchronous setting, moves which have no visible effect for a player are hidden completely from that player. We generalize the usual powerset construction for eliminating partial information to arbitrary, not necessarily observation based, winning conditions, both in the synchronous and in the asynchronous case, and we show that this generalized construction effectively preserves ω-regular winning conditions. From this we infer decidability of the strategy problem for arbitrary ω-regular winning conditions, in both cases. We also show that our ω-regular framework is sufficient for reasoning about synchronous and asynchronous knowledge by proving that any formula of the epistemic temporal specification formalism ETL can be effectively translated into an S1S-formula defining the same specification.