![]() | ![]() |
1989 | ||
---|---|---|
7 | Robert S. Streett, E. Allen Emerson: An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus Inf. Comput. 81(3): 249-264 (1989) | |
1985 | ||
6 | Robert S. Streett: Fixpoints and Program Looping: Reductions form the Propositional MU-Calculus into Propositional Dynamic Logics of Looping. Logic of Programs 1985: 359-372 | |
1984 | ||
5 | Robert S. Streett, E. Allen Emerson: The Propositional Mu-Calculus is Elementary. ICALP 1984: 465-472 | |
1982 | ||
4 | Robert S. Streett: Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable Information and Control 54(1/2): 121-141 (1982) | |
1981 | ||
3 | Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska: The Deducibility Problem in Propositional Dynamic Logic. ICALP 1981: 238-248 | |
2 | Robert S. Streett: Propositional Dynamic Logic of Looping and Converse STOC 1981: 375-383 | |
1979 | ||
1 | Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska: The Deducibility Problem in Propositional Dynamic Logic. Logic of Programs 1979: 12-22 |
1 | E. Allen Emerson | [5] [7] |
2 | Albert R. Meyer | [1] [3] |
3 | Grazyna Mirkowska | [1] [3] |