McNaughton games and extracting strategies for concurrent programs
type: Item
instance of: scholarly article
title: McNaughton games and extracting strategies for concurrent programs
zbMATH Open document ID: 0859.68026
DOI: 10.1016/0168-0072(95)00032-1
author: Alexander Yakhnis
author: Jeffrey Remmel
author: Anil Nerode
published in: Annals of Pure and Applied Logic
publication date: 1997-03-31T00:00:00Z
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 909721
zbMATH Keywords: Büchi-Landweber game
zbMATH Keywords: producer-consumer problem
zbMATH Keywords: McNaughton games
MaRDI profile type: Publication
full work available at URL: 0168-0072(95)00032-1
OpenAlex ID: W2000900855
cites work: Q5525343
cites work: Solving Sequential Conditions by Finite-State Strategies
cites work: Hybrid systems
cites work: Q3995303
cites work: Infinite games played on finite graphs
cites work: Q4010366
cites work: Q4385530
cites work: Q4206380
cites work: Q4206381
cites work: Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
cites work: Gurevich-Harrington's games defined by finite automata
description: scientific article; zbMATH DE number 909721