The temporal logic of branching time

241Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A temporal logic is defined which contains both linear and branching operators. The underlying model is the tree of all possible computations. The following metatheoretical results are proven: 1) an exponential decision procedure for satisfiability; 2) a finite model property; 3) the completeness of an axiomatization. © 1983 Springer-Verlag.

Cite

CITATION STYLE

APA

Ben-Ari, M., Pnueli, A., & Manna, Z. (1983). The temporal logic of branching time. Acta Informatica, 20(3), 207–226. https://doi.org/10.1007/BF01257083

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free