Programming languages and their definition
Programming languages and their definition
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Journal of the ACM (JACM)
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
A really abstract concurrent model and its temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Alternating automata on infinite objects, determinacy and Rabin's theorem
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The Modal mu-calculus Alternation Hierarchy is Strict
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Alternating Automata and Logics over Infinite Words
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
How much memory is needed to win infinite games?
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Impartial Anticipation in Runtime-Verification
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Bounded Model Checking for All Regular Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Regular linear temporal logic with past
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
This paper presents translations forth and back between formulas of the linear time μ-calculus and finite automata with a weak parity acceptance condition. This yields a normal form for these formulas, in fact showing that the linear time alternation hierarchy collapses at level 0 and not just at level 1 as known so far. The translation from formulas to automata can be optimised yielding automata whose size is only exponential in the alternation depth of the formula.