@inproceedings{7cc5a16a8a904afca6b11dba614cbd7e,
title = "Playing Games on Automata",
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.",
author = "Orna Kupferman",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.; 22nd International Symposium on Automated Technology for Verification and Analysis, ATVA 2024 ; Conference date: 21-10-2024 Through 25-10-2024",
year = "2025",
doi = "https://doi.org/10.1007/978-3-031-78709-6_1",
language = "الإنجليزيّة",
isbn = "9783031787089",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "3--21",
editor = "S. Akshay and Aina Niemetz and Sriram Sankaranarayanan",
booktitle = "Automated Technology for Verification and Analysis - 22nd International Symposium, Proceedings",
address = "ألمانيا",
}