An automata theoretic decision procedure for the propositional mu- calculus (Q1119630): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0890-5401(89)90031-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083398633 / rank | |||
Normal rank | |||
Latest revision as of 09:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An automata theoretic decision procedure for the propositional mu- calculus |
scientific article |
Statements
An automata theoretic decision procedure for the propositional mu- calculus (English)
0 references
1989
0 references
A decision procedure of elementary complexity is presented for the propositional mu-calculus. This calculus was introduced by D. Kozen as a powerful generalization of propositional dynamic logic, in which, in particular, Streett's infinite repeating construction \(\Delta\) \(a\) can be expressed. The proof is based on using tree automata and strengthens a result by D. Kozen and R. Parikh on (non-elementary) decidability of the mu-calculus obtained by reduction to the monadic second order theory of many successors.
0 references
elementary complexity
0 references
propositional mu-calculus
0 references
propositional dynamic logic
0 references
tree automata
0 references
