Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

On temporal logic versus datalog

Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos and Foto Afrati
Theoretical Computer Science 303 (1) 103 (2003)
DOI: 10.1016/S0304-3975(02)00447-4
See this article

The Descriptive Complexity of Modal μ Model-checking Games

Karoliina Lehtinen
Electronic Proceedings in Theoretical Computer Science 256 76 (2017)
DOI: 10.4204/EPTCS.256.6
See this article

Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones

Szczepan Hummel
Electronic Proceedings in Theoretical Computer Science 96 247 (2012)
DOI: 10.4204/EPTCS.96.19
See this article

The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity

Julian Gutierrez, Felix Klaedtke and Martin Lange
Electronic Proceedings in Theoretical Computer Science 96 113 (2012)
DOI: 10.4204/EPTCS.96.9
See this article

Inf-datalog, Modal Logic and Complexities

Eugénie Foustoucos and Irène Guessarian
RAIRO - Theoretical Informatics and Applications 43 (1) 1 (2009)
DOI: 10.1051/ita:2007043
See this article

The alternation hierarchy in fixpoint logic with chop is strict too

Martin Lange
Information and Computation 204 (9) 1346 (2006)
DOI: 10.1016/j.ic.2006.05.001
See this article

Computer Science Logic

Julian C. Bradfield
Lecture Notes in Computer Science, Computer Science Logic 2803 72 (2003)
DOI: 10.1007/978-3-540-45220-1_8
See this article

Rudiments of μ-Calculus

Studies in Logic and the Foundations of Mathematics, Rudiments of μ-Calculus 146 269 (2001)
DOI: 10.1016/S0049-237X(01)80013-6
See this article

Handbook of Modal Logic

Julian Bradfield and Colin Stirling
Studies in Logic and Practical Reasoning, Handbook of Modal Logic 3 721 (2007)
DOI: 10.1016/S1570-2464(07)80015-2
See this article

Automating the analysis of design component contracts

Jing Dong, Paulo S. C. Alencar and Donald D. Cowan
Software: Practice and Experience 36 (1) 27 (2006)
DOI: 10.1002/spe.681
See this article

Deciding low levels of tree-automata hierarchy

Igor Walukiewicz
Electronic Notes in Theoretical Computer Science 67 61 (2002)
DOI: 10.1016/S1571-0661(04)80541-3
See this article

On the universal and existential fragments of the μ-calculus

Thomas A. Henzinger, Orna Kupferman and Rupak Majumdar
Theoretical Computer Science 354 (2) 173 (2006)
DOI: 10.1016/j.tcs.2005.11.015
See this article

The Arity Hierarchy in the Polyadic μ-Calculus

Martin Lange
Electronic Proceedings in Theoretical Computer Science 191 105 (2015)
DOI: 10.4204/EPTCS.191.10
See this article

The μ-calculus alternation hierarchy collapses over structures with restricted connectivity

Julian Gutierrez, Felix Klaedtke and Martin Lange
Theoretical Computer Science 560 292 (2014)
DOI: 10.1016/j.tcs.2014.03.027
See this article

Computer Science Logic

J. C. Bradfield
Lecture Notes in Computer Science, Computer Science Logic 1862 247 (2000)
DOI: 10.1007/3-540-44622-2_16
See this article

FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

Igor Walukiewicz
Lecture Notes in Computer Science, FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science 3821 79 (2005)
DOI: 10.1007/11590156_5
See this article