TSO Games -- On the decidability of safety games under the total store order semantics

We consider an extension of the classical Total Store Order (TSO) semantics by expanding it to turn-based 2-player safety games. During her turn, a player can select any of the communicating processes and perform its next transition. We consider different formulations of the safety game problem depe...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronic proceedings in theoretical computer science Ročník 390; s. 82
Hlavní autoři: Spengler, Stephan, Sil, Sanchari
Médium: Paper Journal Article
Jazyk:angličtina
Vydáno: Ithaca Cornell University Library, arXiv.org 02.10.2023
Témata:
Communication
Games
Safety
Semantics
ISSN:2075-2180, 2331-8422, 2075-2180
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider an extension of the classical Total Store Order (TSO) semantics by expanding it to turn-based 2-player safety games. During her turn, a player can select any of the communicating processes and perform its next transition. We consider different formulations of the safety game problem depending on whether one player or both of them transfer messages from the process buffers to the shared memory. We give the complete decidability picture for all the possible alternatives.
Bibliografie:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2075-2180
2331-8422
2075-2180
DOI:10.48550/arxiv.2310.00990