Abstract
The interaction between a system and its environment corresponds to a game in which the system and the environment generate a word over the alphabet of assignments to the input and output signals. The system player wins if the generated word satisfies a desired specification. A correct reactive system has to satisfy its specification in all environments, and thus corresponds to a winning strategy for the system player in the above game. This view is the key to the game-based approach for reactive synthesis. It reduces synthesis to the problem of generating winning strategies in two-player games whose winning conditions are on-going behaviors, which can be specified by automata on infinite words. The paper presents the game-based approach, focusing on ways to cope with the fact that the game cannot be played over nondeterministic automata.
| Original language | English |
|---|---|
| Title of host publication | Automated Technology for Verification and Analysis - 22nd International Symposium, Proceedings |
| Editors | S. Akshay, Aina Niemetz, Sriram Sankaranarayanan |
| Publisher | Springer Science and Business Media Deutschland GmbH |
| Pages | 3-21 |
| Number of pages | 19 |
| ISBN (Print) | 9783031787089 |
| DOIs | |
| State | Published - 2025 |
| Event | 22nd International Symposium on Automated Technology for Verification and Analysis, ATVA 2024 - Kyoto, Japan Duration: 21 Oct 2024 → 25 Oct 2024 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 15054 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 22nd International Symposium on Automated Technology for Verification and Analysis, ATVA 2024 |
|---|---|
| Country/Territory | Japan |
| City | Kyoto |
| Period | 21/10/24 → 25/10/24 |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.