The Common Fragment of ACTL and LTL

DOI10.1007/978-3-540-78499-9_13MaRDI QIDQ5458358zbMATH OpenOpenAlexFDO

Authors Mikołaj Bojańczyk

Publication date 11 April 2008

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78499-9_13

Mathematics Subject Classification ID

Temporal logic (03B44) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automaton-Based Criteria for Membership in CTL
• scientific article; zbMATH DE number 4119650
• scientific article; zbMATH DE number 4119616
• SOFSEM 2005: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 4027441

Cited in

(6)

• Quantifier alternation for infinite words
• Temporal logic and fair discrete systems
• Factorization Forests
• Partially ordered automata and piecewise testability
• Branching-time logics and fairness, revisited
• Fragments of first-order logic over infinite words

This page was built for publication: The Common Fragment of ACTL and LTL

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