Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Robert S. Streett
1980 – 1989
- 1989
[j2]Robert S. Streett, E. Allen Emerson: An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus. Inf. Comput. 81(3): 249-264 (1989)- 1985
[c5]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
[c4]Robert S. Streett, E. Allen Emerson: The Propositional Mu-Calculus is Elementary. ICALP 1984: 465-472- 1982
[j1]Robert S. Streett: Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable. Information and Control 54(1/2): 121-141 (1982)- 1981
[c3]Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska: The Deducibility Problem in Propositional Dynamic Logic. ICALP 1981: 238-248
[c2]
1970 – 1979
- 1979
[c1]Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska: The Deducibility Problem in Propositional Dynamic Logic. Logic of Programs 1979: 12-22
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:32 CET by the dblp team



