On regular temporal logics with past

DOI10.1007/S00236-010-0118-3MaRDI QIDQ977176zbMATH OpenOpenAlexFDO

Authors Christian Dax, Felix Klaedtke, Martin Lange

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) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• On Regular Temporal Logics with Past,
• Regular linear temporal logic with past
• Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
• Formal Methods in Computer-Aided Design
• Publication:4472249

Cites work

• scientific article; zbMATH DE number 5604077 (Why is no real title available?)
• scientific article; zbMATH DE number 3940713 (Why is no real title available?)
• scientific article; zbMATH DE number 2080056 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• scientific article; zbMATH DE number 1863182 (Why is no real title available?)
• scientific article; zbMATH DE number 1903365 (Why is no real title available?)
• A note on the reduction of two-way automata to one-way automata
• A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL
• Alternating finite automata on \(\omega\)-words
• Alternation Elimination by Complementation (Extended Abstract)
• Dynamic linear time temporal logic
• First-order definable languages
• Formal Methods in Computer-Aided Design
• Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
• Mathematical Foundations of Computer Science 2003
• Regular linear temporal logic with past
• Relationships between nondeterministic and deterministic tape complexities
• SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
• Some Complexity Results for SystemVerilog Assertions
• Temporal logic can be more expressive
• The complexity of propositional linear temporal logics in simple cases

Cited in

(11)

• Regular linear temporal logic with past
• On Regular Temporal Logics with Past,
• Formal Methods in Computer-Aided Design
• Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
• scientific article; zbMATH DE number 2080056 (Why is no real title available?)
• Visibly linear temporal logic
• scientific article; zbMATH DE number 7056237 (Why is no real title available?)
• Temporal multi-valued logic with lost worlds in the past
• Almost event-rate independent monitoring
• From Monadic Logic to PSL
• Compiling \(\mathrm{FL}^\mathrm{res}\) on finite words

Describes a project that uses

Uses Software

• NuSMV

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q977176)