Skip Navigation

Journal of Logic and Computation 2002 12(4):561-581; doi:10.1093/logcom/12.4.561
© 2002 by Oxford University Press
This Article
Right arrow Full Text (PDF)
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 Bolotov, A.
Right arrow Articles by Dixon, C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

On the Relationship between {omega}-automata and Temporal Logic Normal Forms

Alexander Bolotov1, Michael Fisher2 and Clare Dixon2

1 Harrow School of Computer Science, University of Westminster, Harrow HA1 3TP, UK. E-mail: A.Bolotov{at}westminster.ac.uk, 2 Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, UK. E-mail: {M.Fisher,C.Dixon}{at}csc.liv.ac.uk

We consider the relationship between {omega}-automata and a specific logical formulation based on a normal form for temporal logic formulae. While this normal form was developed for use with execution and clausal resolution in temporal logics, we here show how it can represent, syntactically, {omega}-automata in a high-level way. Technical proofs of the correctness of this representation are given.

Keywords: Temporal logics; normal forms; automata; theorem-proving; clausal resolution

Received 9 January 2001.


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


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
B. Moszkowski
Using Temporal Logic to Analyse Temporal Logic: A Hierarchical Approach Based on Intervals
J Logic Computation, April 1, 2007; 17(2): 333 - 409.
[Abstract] [Full Text] [PDF]


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.