Ambiguous Classes in the Games μ-Calculus Hierarchy-Reference-Cited by-同舟云学术

Ambiguous Classes in the Games μ-Calculus Hierarchy

Published:2003 Issue: Volume: Page:70-86
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Arnold André,Santocanale Luigi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36576-1_5

Reference23 articles.

1. A. Arnold. The μ-calculus alternation-depth hierarchy is strict on binary trees. Theor. Inform. Appl.,33(4–5):329–339, 1999.

2. A. Arnold and D. Niwiński. Fixed point characterization of weak monadic logic definable sets of trees. In Tree automata and languages (Le Touquet, 1990), volume 10 of Stud. Comput. Sci. Artificial Intelligence, pages 159–188. North-Holland, Amsterdam, 1992.

3. A. Arnold and D. Niwiński. Rudiments of μ-calculus, volume 146 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, 2001.

4. A. Arnold, A. Vincent, and I. Walukiewicz. Games for synthesis of controllers with partial information. To appear in Theoret. Comput. Sci., 2002.

5. A. Blass. A game semantics for linear logic. Ann. Pure Appl. Logic,56(1–3):183–220, 1992.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Variable Hierarchy for the Lattice μ-Calculus;Logic for Programming, Artificial Intelligence, and Reasoning;2008

2. From Logic to Games;Lecture Notes in Computer Science;2005

3. Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata;Implementation and Application of Automata;2003

4. ∏2 ∩ Σ2 ≡ AFMC;Automata, Languages and Programming;2003