Načítá se...
On-the-Fly Synthesis for Strictly Alternating Games
We study two-player zero-sum infinite reachability games with strictly alternating moves of the players allowing us to model a race between the two opponents. We develop an algorithm for deciding the winner of the game and suggest a notion of alternating simulation in order to speed up the computati...
Uloženo v:
| Vydáno v: | Application and Theory of Petri Nets and Concurrency |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2020
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7324245/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51831-8_6 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|