CRYPTO '88 Proceedings on Advances in cryptology
Distributed Controller Synthesis for Local Specifications
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Decidable Class of Asynchronous Distributed Controllers
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
On the (High) Undecidability of Distributed Synthesis Problems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Distributed synthesis for well-connected architectures
Formal Methods in System Design
Information flow in concurrent games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Modular strategies for recursive game graphs
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
From asynchronous to synchronous specifications for distributed program synthesis
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Information Tracking in Games on Graphs
Journal of Logic, Language and Information
A communication based model for games of imperfect information
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
The complexity of decentralized control of Markov decision processes
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Reaching and Distinguishing States of Distributed Systems
SIAM Journal on Computing
Distributed synthesis for well-connected architectures
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On distributed program specification and synthesis in architectures with cycles
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Tree automata and discrete distributed games
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Distributed games with causal memory are decidable for series-parallel systems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Decidability of well-connectedness for distributed synthesis
Information Processing Letters
Pushdown module checking with imperfect information
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Pushdown module checking with imperfect information
Information and Computation
| Hi-index | 0.00 |
We generalize the alternation machines of Chandra, Kozen and Stockmeyer [1] and the private alternation machines of Reif [14] to model multiple person (team) games of incomplete information. The resulting classes of machines are "multiple person alternation machines". The characterization of certain time and space bounded versions of these machines demonstrate interesting relationships between ordinary time and space hierarchies (Table 1). Our results are applied to relative succintness and power questions of finite state machines and to complexity questions of parallel finite state machines. Other machine variants, including private alternating pushdown store automata and Markovian alternation machines, are discussed.