Alternative semantics for temporal logics (Q2265815): Difference between revisions

The paper studies relationships between alternative semantics for temporal logics. Three common constraints on the allowed sets of computation paths, the suffix closure [\textit{D. Harel}, \textit{D. Kozen} and \textit{R. Parikh}, J. Comput. Syst. Sci. 25, 144-170 (1982; Zbl 0494.03016)], the fusion closure [\textit{V. R. Pratt}, Process logic, in: Proc. 6th ACM Symp. on Principles of Programming Languages (1979)] and the limit closure [\textit{K. Abrahamson}, Expressiveness and decidability of logics of processes, Ph. D. thesis, Univ. of Washington, Seattle (1980)], are shown to be independent and their conjunction to be equivalent to the R-generable paths [\textit{Z. Manna} and \textit{A. Pnueli}, Lect. Notes Comput. Sci. 71, 385-409 (1979; Zbl 0404.68011)].