Article (Scientific journals)
Temporal Logic Can Be More Expressive
Wolper, Pierre
1983In Information and Control, 56 (1--2), p. 72-99
Peer Reviewed verified by ORBi
 

Files


Full Text
ic83-2.pdf
Publisher postprint (1.21 MB)
Request a copy

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
temporal logic; automata; right-linear grammar
Abstract :
[en] We first review Temporal Logic and prove that there are some properties of sequences that it cannot express, though these are expressible using for instance regular expressions. Then, we show how Temporal Logic can be extended to express any property definable by a right-linear grammar and hence a regular expression. Finally, we give a complete axiomatization and a decision procedure for the extended Temporal Logic and examine its complexity.
Disciplines :
Computer science
Author, co-author :
Wolper, Pierre  ;  Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Informatique (parallélisme et banques de données)
Language :
English
Title :
Temporal Logic Can Be More Expressive
Publication date :
1983
Journal title :
Information and Control
ISSN :
0019-9958
Publisher :
Academic Press, New York, United States - New York
Volume :
56
Issue :
1--2
Pages :
72-99
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBi :
since 09 July 2011

Statistics


Number of views
134 (16 by ULiège)
Number of downloads
4 (2 by ULiège)

Scopus citations®
 
453
Scopus citations®
without self-citations
442
OpenCitations
 
389

Bibliography


Similar publications



Contact ORBi