Regular linear temporal logic

Authors:
Martin Leucker;César Sánchez
Affiliations:
Institut für Informatik, TU München, Germany;Computer Science Department, Stanford University, Stanford and Computer Engineering Department, University of California, Santa Cruz
Venue:
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Year:
2007

Citing 16
Cited 5

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends

Current trends in concurrency. Overviews and tutorials
Alternating automata on infinite trees

Theoretical Computer Science
Reasoning about infinite computations

Information and Computation
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
A really abstract concurrent model and its temporal logic

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Characterizing Correctness Properties of Parallel Programs Using Fixpoints

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Results on the Propositional µ-Calculus

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking Fixed Point Logic with Chop

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Weak Alternating Automata Are Not That Weak

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A modal fixpoint logic with chop

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Weak automata for the linear time µ-calculus

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation

Impartial Anticipation in Runtime-Verification

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Formal parameters of phonology: from government phonology to SPE

ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
The theory and practice of SALT

NFM'11 Proceedings of the Third international conference on NASA Formal methods
Regular linear temporal logic with past

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
How to translate efficiently extensions of temporal logics into alternating automata

ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present regular linear temporal logic (RLTL), a logic that generalizes linear temporal logic with the ability to use regular expressions arbitrarily as sub-expressions. Every LTL operator can be defined as a context in regular linear temporal logic. This implies that there is a (linear) translation from LTL to RLTL. Unlike LTL, regular linear temporal logic can define all ω-regular languages, while still keeping the satisfiability problem in PSPACE. Unlike the extended temporal logics ETL*, RLTL is defined with an algebraic signature. In contrast to the linear time µ-calculus, RLTL does not depend on fix-points in its syntax.