Bearbeite Article: Article3369514656

Du bist aus dem folgenden Grund nicht berechtigt, diese Seite bearbeiten:

Diese Aktion ist auf Benutzer beschränkt, die der Gruppe „Benutzer“ angehören.

Authors

First author:

Optionen umschalten

Further authors:

×Tomás Brázdil
×Marcus Größer
×Antonín Kucera

list of full author names as shown on paper, separated by semicolon

Article

Referiert:	Hilfe
Titel:	Hilfe
To appear:	Hilfe
Jahr:	(If the publication is "to appear", enter the expected year)Hilfe
Monat:	Hilfe
Zeitschrift:	Hilfe
Volume:	Hilfe
Nummer:	Hilfe
Seiten:	Hilfe
Verlag:	Hilfe
Bemerkung:	Hilfe

weitere Tools

Weitere hinzufügen

weitere Datasets

Weitere hinzufügen

Details

Bild:	Datei hochladen You can provide a picture here, such as the front page of the journal, to be displayed with your publication. If you provide a pdf file in "Download" below, and no picture here, the first page of the pdf file will be displayed with your publication. In other cases, an icon will be displayed. Hilfe
Abstract:	Stochastic game logic (SGL) is a new temporal logic for multi-agent systems modeled by turn-based multi-player games with discrete transition probabilities. It combines features of alternating-time temporal logic (ATL), probabilistic computation tree logic and extended temporal logic. SGL contains an ATL-like modality to specify the individual cooperation and reaction facilities of agents in the multi-player game to enforce a certain winning objective. While the standard ATL modality states the existence of a strategy for a certain coalition of agents without restricting the range of strategies for the semantics of inner SGL formulae, we deal with a more general modality. It also requires the existence of a strategy for some coalition, but imposes some kind of strategy binding to inner SGL formulae. This paper presents the syntax and semantics of SGL and discusses its model checking problem for different types of strategies. The model checking problem of SGL turns out to be undecidable when dealing with the full class of history-dependent strategies. We show that the SGL model checking problem for memoryless deterministic strategies as well as the model checking problem of the qualitative fragment of SGL for memoryless randomized strategies is PSPACE-complete, and we establish a close link between natural syntactic fragments of SGL and the polynomial hierarchy. Further, we give a reduction from the SGL model checking problem under memoryless randomized strategies into the Tarski algebra which proves the problem to be in EXPSPACE. Hilfe
ISBN:	Hilfe
ISSN:	Hilfe
Download:	Datei hochladen Upload a single file. No comma is allowed after the file extension. If the publisher is springer, type "Springer" in the publisher field above. It will automatically generate the acknowledgement according to the licence. Hilfe
Slides:	Datei hochladen Upload a single file. No comma is allowed after the file extension. Hilfe
Link:	Here you can provide links to additional files. Use comma and space (", ") to separate the links. Hilfe
DOI Name:	If the publisher is springer, type "Springer" in the publisher field above. It will automatically generate the acknowledgement according to the licence. If the DOI name is also provided, the acknowledgement will contain the DOI link. Hilfe
Projekt:	To deselect, use Control. Hilfe
Forschungsgruppe:	To deselect, use Control. Hilfe
BibTex:	Leave blank if you want the system to generate a bibtex entry. You can also enter your own bibtex entry here. In that case, do not enter {{ nor }}, but put a space in between, that is, type { { or } }, respectively. It will be displayed properly. Hilfe

Forschungsgebiet

Weitere hinzufügen

Freitext:

Abbrechen