U.S. Department of Energy
Office of Scientific and Technical Information

Revisiting separation: algorithms and complexity

Abstract

Abstract Linear temporal logic (LTL) with Since and Until modalities is expressively equivalent, over the class of complete linear orders, to a fragment of first-order logic known as FOMLO (first-order monadic logic of order). It turns out that LTL, under some basic assumptions, is expressively complete if and only if it has the property, called separation, that every formula is equivalent to a Boolean combination of formulas that each refer only to the past, present or future. Herein we present simple algorithms and their implementations to perform separation of the LTL with Since and Until, over discrete and complete linear orders, and translation from FOMLO formulas into equivalent temporal logic formulas. We additionally show that the separation of a certain fragment of LTL results in at most a double exponential size growth.

Authors:
[2]
1. Departamento de Matemática, Instituto Superior Técnico, U Lisboa, Portugal
2. Departamento de Matemática, Instituto Superior Técnico, U Lisboa, Portugal and Centro de Matemática, Aplicações Fundamentais e Investigação Operacional, U Lisboa, Portugal
Publication Date:
USDOE Office of Nuclear Energy (NE), Nuclear Fuel Cycle and Supply Chain
OSTI Identifier:
1600564
Grant/Contract Number:
UIDB/04561/2020
Resource Type:
Published Article
Journal Name:
Logic Journal of the IGPL
Journal Name: Logic Journal of the IGPL; Journal ID: ISSN 1367-0751
Publisher:
Oxford University Press
Country of Publication:
Country unknown/Code not available
Language:
English

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record
DOI: https://doi.org/10.1093/jigpal/jzz081
Other availability

Save / Share:
Save to My Library

Works referenced in this record:

An Until Hierarchy and Other Applications of an Ehrenfeucht–Fraı̈ssé Game for Temporal Logic journal, July 2000

• Etessami, Kousha; Wilke, Thomas
• Information and Computation, Vol. 160, Issue 1-2

The complexity of propositional linear temporal logics journal, July 1985

• Sistla, A. P.; Clarke, E. M.
• Journal of the ACM (JACM), Vol. 32, Issue 3

A Proof of Kamp's theorem journal, January 2014

• Rabinovich, Alexander
• Logical Methods in Computer Science, Vol. 10, Issue 1