The Common Fragment of ACTL and LTL

DOI10.1007/978-3-540-78499-9_13zbMATH Open1139.68036OpenAlexW87998981MaRDI QIDQ5458358FDOQ5458358

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

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (6)

• Branching-time logics and fairness, revisited
• Fragments of first-order logic over infinite words
• Temporal logic and fair discrete systems
• Factorization Forests
• Title not available (Why is that?)
• Quantifier alternation for 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)