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: 94,452

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

Polynomial-time analogues of isolatedness.Leon Harkleroad - 1992 - Annals of Pure and Applied Logic 56 (1-3):173-182.
Gurevich-Harrington's games defined by finite automata.Alexander Yakhnis & Vladimir Yakhnis - 1993 - Annals of Pure and Applied Logic 62 (3):265-294.
Verification of concurrent programs: the automata-theoretic framework.Moshe Y. Vardi - 1991 - Annals of Pure and Applied Logic 51 (1-2):79-98.
Every recursive boolean algebra is isomorphic to one with incomplete atoms.Rod Downey - 1993 - Annals of Pure and Applied Logic 60 (3):193-206.

Analytics

Added to PP
2014-01-16

Downloads
14 (#1,013,640)

6 months
2 (#1,485,265)

Historical graph of downloads
How can I increase my downloads?