Regular Linear Temporal Logic with Past

@inproceedings{Snchez2010RegularLT,
  title={Regular Linear Temporal Logic with Past},
  author={C{\'e}sar S{\'a}nchez and Martin Leucker},
  booktitle={VMCAI},
  year={2010}
}
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logic (LTL) to all ω-regular languages. The syntax of RLTL consists of an algebraic signature from which expressions are built. In particular, RLTL does not need or expose fix-point binders (like linear time μ-calculus), or automata to build and instantiate operators (like ${\textrm{ETL}_*}$). Past operators are easily… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

Almost event-rate independent monitoring

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Visibly Linear Temporal Logic

  • Journal of Automated Reasoning
  • 2017
VIEW 11 EXCERPTS
CITES METHODS & BACKGROUND

Declaratively building behavior by means of scenario clauses

  • Requirements Engineering
  • 2015
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Visibly Linear Temporal Logic

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS