CiteSeer.IST HomeCheck: The following citations are predicted to all refer to the same paper. Details
M. Ben-Ari, J. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: finite models, complexity and completeness. Journal of Computer and System Sciences, 25:402--417, 1982.
M. Ben-Ari, J. Y. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: finite models, complexity and completeness. J. Comput. Syst. Sci., 25:402--417, 1982.
M. Ben-Ari, J. Y. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: finite models, complexity, and completeness. Journal of Computer and System Sciences, 25:402--417, 1982.
Ben-Ari, M., Halpern, J., and Pnueli, A.: 1982, Deterministic Propositional Dynamic Logic: Finite Models, Complexity and Completeness, Journal of Computer and System Sciences, 25, pp 402-417.
Mordechai Ben-Ari, Joseph J. Halpern, and Amir Pnuelu. Deterministic propositional dynamic logic: Finite models, complexity, and completeness. Journal of Computer and System Science, 25:402 - 417, 1982.
M. Ben-Ari, J. Y. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: Finite models, complexity, and completeness. Journal of Computer and System Sciences, 25(3):402--417, 1982.