Playing Games on Automata

Orna Kupferman

doi:10.1007/978-3-031-78709-6_1

Playing Games on Automata

Orna Kupferman^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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	https://doi.org/10.1007/978-3-031-78709-6_1
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.

Access to Document

10.1007/978-3-031-78709-6_1

Cite this

Kupferman, O. (2025). Playing Games on Automata. In S. Akshay, A. Niemetz, & S. Sankaranarayanan (Eds.), Automated Technology for Verification and Analysis - 22nd International Symposium, Proceedings (pp. 3-21). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 15054 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-78709-6_1

Kupferman, Orna. / Playing Games on Automata. Automated Technology for Verification and Analysis - 22nd International Symposium, Proceedings. editor / S. Akshay ; Aina Niemetz ; Sriram Sankaranarayanan. Springer Science and Business Media Deutschland GmbH, 2025. pp. 3-21 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{bfdcd5b33e5d4e71969038a936512014,

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 = "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 = "גרמניה",

}

Kupferman, O 2025, Playing Games on Automata. in S Akshay, A Niemetz & S Sankaranarayanan (eds), Automated Technology for Verification and Analysis - 22nd International Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 15054 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 3-21, 22nd International Symposium on Automated Technology for Verification and Analysis, ATVA 2024, Kyoto, Japan, 21/10/24. https://doi.org/10.1007/978-3-031-78709-6_1

Playing Games on Automata. / Kupferman, Orna.
Automated Technology for Verification and Analysis - 22nd International Symposium, Proceedings. ed. / S. Akshay; Aina Niemetz; Sriram Sankaranarayanan. Springer Science and Business Media Deutschland GmbH, 2025. p. 3-21 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 15054 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Playing Games on Automata

AU - Kupferman, Orna

N1 - Publisher Copyright: © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

PY - 2025

Y1 - 2025

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85219192146

U2 - 10.1007/978-3-031-78709-6_1

DO - 10.1007/978-3-031-78709-6_1

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85219192146

SN - 9783031787089

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 3

EP - 21

BT - Automated Technology for Verification and Analysis - 22nd International Symposium, Proceedings

A2 - Akshay, S.

A2 - Niemetz, Aina

A2 - Sankaranarayanan, Sriram

PB - Springer Science and Business Media Deutschland GmbH

T2 - 22nd International Symposium on Automated Technology for Verification and Analysis, ATVA 2024

Y2 - 21 October 2024 through 25 October 2024

ER -

Kupferman O. Playing Games on Automata. In Akshay S, Niemetz A, Sankaranarayanan S, editors, Automated Technology for Verification and Analysis - 22nd International Symposium, Proceedings. Springer Science and Business Media Deutschland GmbH. 2025. p. 3-21. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-78709-6_1