McNaughton games and extracting strategies for concurrent programs

Annals of Pure and Applied Logic 78 (1-3):203-242 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A Modal Logic for Mixed Strategies.Joshua Sack & Wiebe van der Hoek - 2014 - Studia Logica 102 (2):339-360.
Games with Unknown Past.Bakhadyr Khoussainov, Alexander Yakhnis & Vladimir Yakhnis - 1998 - Mathematical Logic Quarterly 44 (2):185-204.
Fine-grained Concurrency with Separation Logic.Kalpesh Kapoor, Kamal Lodaya & Uday S. Reddy - 2011 - Journal of Philosophical Logic 40 (5):583-632.
Parallel strategies.Pavel Pudlák - 2003 - Journal of Symbolic Logic 68 (4):1242-1250.
Information Tracking in Games on Graphs.Dietmar Berwanger & Łukasz Kaiser - 2010 - Journal of Logic, Language and Information 19 (4):395-412.
Infinite games played on finite graphs.Robert McNaughton - 1993 - Annals of Pure and Applied Logic 65 (2):149-184.

Analytics

Added to PP
2014-01-16

Downloads
12 (#929,749)

6 months
1 (#1,042,085)

Historical graph of downloads
How can I increase my downloads?