Computing the Rabin Index of a Parity Automaton
RAIRO-Theor. Inf. Appl., 33 6 (1999) 495-505
Published online: 2002-08-15
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):
13244 99 (2022)
https://doi.org/10.1007/978-3-030-99527-0_6
Computer Aided Verification
Alexandre Duret-Lutz, Etienne Renault, Maximilien Colange, et al.Lecture Notes in Computer Science, Computer Aided Verification 13372 174 (2022)
https://doi.org/10.1007/978-3-031-13188-2_9
Automated Technology for Verification and Analysis
Florian Renkin, Alexandre Duret-Lutz and Adrien PommelletLecture Notes in Computer Science, Automated Technology for Verification and Analysis 12302 127 (2020)
https://doi.org/10.1007/978-3-030-59152-6_7
Tools and Algorithms for the Construction and Analysis of Systems
Ernst Moritz Hahn, Mateo Perez, Sven Schewe, et al.Lecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems 11427 395 (2019)
https://doi.org/10.1007/978-3-030-17462-0_27
Automated Technology for Verification and Analysis
Christof Löding and Anton PirogovLecture Notes in Computer Science, Automated Technology for Verification and Analysis 11781 317 (2019)
https://doi.org/10.1007/978-3-030-31784-3_18
Disjunctive form and the modal μ alternation hierarchy
Karoliina LehtinenElectronic Proceedings in Theoretical Computer Science 191 117 (2015)
https://doi.org/10.4204/EPTCS.191.11
The Rabin index of parity games: Its complexity and approximation
Michael Huth, Jim Huan-Pu Kuo and Nir PitermanInformation and Computation 245 36 (2015)
https://doi.org/10.1016/j.ic.2015.06.005
Decision Problems for Deterministic Pushdown Automata on Infinite Words
Christof LödingElectronic Proceedings in Theoretical Computer Science 151 55 (2014)
https://doi.org/10.4204/EPTCS.151.4
Safety first: a two-stage algorithm for the synthesis of reactive systems
Saqib Sohail and Fabio SomenziInternational Journal on Software Tools for Technology Transfer 15 (5-6) 433 (2013)
https://doi.org/10.1007/s10009-012-0224-3
Computer Aided Verification
Ming-Hsien Tsai, Yih-Kuen Tsay and Yu-Shiang HwangLecture Notes in Computer Science, Computer Aided Verification 8044 883 (2013)
https://doi.org/10.1007/978-3-642-39799-8_62
34 (2013)
https://doi.org/10.1109/FMCAD.2013.6679388
Hardware and Software: Verification and Testing
Michael Huth, Jim Huan-Pu Kuo and Nir PitermanLecture Notes in Computer Science, Hardware and Software: Verification and Testing 7261 259 (2012)
https://doi.org/10.1007/978-3-642-34188-5_25
Verification, Model Checking, and Abstract Interpretation
Saqib Sohail, Fabio Somenzi and Kavita RaviLecture Notes in Computer Science, Verification, Model Checking, and Abstract Interpretation 4905 309 (2008)
https://doi.org/10.1007/978-3-540-78163-9_26
Infinite Words - Automata, Semigroups, Logic and Games
Pure and Applied Mathematics, Infinite Words - Automata, Semigroups, Logic and Games 141 499 (2004)https://doi.org/10.1016/S0079-8169(04)80014-X
A gap property of deterministic tree languages
Damian Niwiński and Igor WalukiewiczTheoretical Computer Science 303 (1) 215 (2003)
https://doi.org/10.1016/S0304-3975(02)00452-8
Deciding low levels of tree-automata hierarchy
Igor WalukiewiczElectronic Notes in Theoretical Computer Science 67 61 (2002)
https://doi.org/10.1016/S1571-0661(04)80541-3