Robert S. Streett

According to our database, Robert S. Streett authored at least 6 papers between 1981 and 1989.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1989

An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus

Robert S. Streett, E. Allen Emerson

Inf. Comput., June, 1989

1985

Fixpoints and Program Looping: Reductions form the Propositional MU-Calculus into Propositional Dynamic Logics of Looping.

Robert S. Streett

Proceedings of the Logics of Programs, 1985

1984

The Propositional Mu-Calculus is Elementary.

Robert S. Streett, E. Allen Emerson

Proceedings of the Automata, 1984

1982

Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable

Robert S. Streett

Inf. Control., 1982

1981

Propositional Dynamic Logic of Looping and Converse

Robert S. Streett

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

The Deducibility Problem in Propositional Dynamic Logic.

Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska

Proceedings of the Automata, 1981