Alternating refinement relations
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 163-178
- https://doi.org/10.1007/bfb0055622
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Computing simulations on finite and infinite graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Alternating-time Temporal LogicPublished by Springer Nature ,1998
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and SafraTheoretical Computer Science, 1995
- Deciding bisimilarity is P -completeFormal Aspects of Computing, 1992
- Operational and Algebraic Semantics of Concurrent ProcessesPublished by Elsevier ,1990
- Modelling knowledge and action in distributed systemsDistributed Computing, 1989
- Alternating automata on infinite treesTheoretical Computer Science, 1987
- Automata-theoretic techniques for modal logics of programsJournal of Computer and System Sciences, 1986
- Number of quantifiers is better than number of tape cellsJournal of Computer and System Sciences, 1981
- Stochastic GamesProceedings of the National Academy of Sciences, 1953