DocumentCode :
3290302
Title :
Once and for all [temporal logic]
Author :
Kupferman, Orna ; Pnueli, Amir
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
fYear :
1995
fDate :
26-29 Jun 1995
Firstpage :
25
Lastpage :
35
Abstract :
It has long been known that past-time operators add no expressive power to linear temporal logics. In this paper, we consider the extension of branching temporal logics with past-time operators. Two possible views regarding the nature of past in a branching-time model induce two different such extensions. In the first view, past is branching and each moment in time may have several possible futures and several possible pasts. In the second view, past is linear and each moment in time may have several possible futures and a unique past. Both views assume that past is finite. We discuss the practice of these extensions as specification languages, characterize their expressive power, and examine the complexity of their model-checking and satisfiability problems
Keywords :
computational complexity; decidability; specification languages; temporal logic; branching temporal logics; branching-time model; complexity; expressive power; model-checking; past-time operators; satisfiability problems; specification languages; temporal logic; Computer science; Logic; Natural languages; Page description languages; Specification languages;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 1995. LICS '95. Proceedings., Tenth Annual IEEE Symposium on
Conference_Location :
San Diego, CA
ISSN :
1043-6871
Print_ISBN :
0-8186-7050-9
Type :
conf
DOI :
10.1109/LICS.1995.523241
Filename :
523241
Link To Document :
بازگشت