Skip Navigation



Journal of Logic and Computation Advance Access published online on February 6, 2008
Journal of Logic and Computation, doi:10.1093/logcom/exn002
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
18/4/615    most recent
exn002v1
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Guelev, D. P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original papers

A Syntactical Proof of the Canonical Reactivity Form for Past Linear Temporal Logic

Dimitar P. Guelev

Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria.

E-mail: gelevdp{at}math.bas.bg

Received 22 January 2007.


  Abstract

We present a new proof of the fact that every formula in linear temporal logic with past is equivalent to a formula of the form

Formula
where {alpha}i and βi are past formulas, which is known as general canonical reactivity form. The original proof is based on the fact that a finite automaton recognizes an LTL-definable {omega}-language iff it is counter-free, which was proved in Lenore Zuck's thesis and relies on the theorem of Krohn-Rhodes about cascade decomposition of finite automata. Unlike that, the proof presented in this paper involves only equivalence transformations of LTL formula and makes use of Gabbay's separation theorem, whose proof is based on equivalence transformations too. This makes it possible to obtain the canonical form without resorting to constructions outside LTL with past operators such as automata.

Keywords: Linear temporal logic; canonical reactivity normal form; separation


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.