On regular temporal logics with past

DOI10.1007/s00236-010-0118-3zbMath1214.68211OpenAlexW2033144652MaRDI QIDQ977176

Martin Lange, Felix Klaedtke, Christian Dax

Publication date: 21 June 2010

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/18378

zbMATH Keywords

alternating automatafinite-state model checkinglinear-time temporal logicsregular/\(\omega\)-regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Temporal logic (03B44)

Related Items (3)

Visibly linear temporal logic ⋮ Almost event-rate independent monitoring ⋮ Unnamed Item

Uses Software

• NuSMV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating finite automata on \(\omega\)-words
• A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL
• A note on the reduction of two-way automata to one-way automata
• Dynamic linear time temporal logic
• The complexity of propositional linear temporal logics in simple cases
• Relationships between nondeterministic and deterministic tape complexities
• Temporal logic can be more expressive
• SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
• Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
• Regular Linear Temporal Logic with Past
• Mathematical Foundations of Computer Science 2003
• Formal Methods in Computer-Aided Design
• Alternation Elimination by Complementation (Extended Abstract)
• Some Complexity Results for SystemVerilog Assertions

This page was built for publication: On regular temporal logics with past