Automaton-Based Criteria for Membership in CTL

DOI10.1145/3209108.3209143MaRDI QIDQ5145288zbMATH OpenOpenAlexFDO

Authors Udi Boker, Yariv Shaulian

Publication date 20 January 2021

Published in Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3209108.3209143

zbMATH Keywords

LTLCTLautomaton characterization

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Temporal logic (03B44)

Recommendations

• Testing membership in counter automaton languages
• An automata-based approach for \(\text{CTL}^{*}\) with constraints
• Model checking CTL over restricted classes of automatic structures
• Automata-based CSL model checking
• Finite automata with generalized acceptance criteria
• scientific article; zbMATH DE number 1405667
• A decision procedure for \(\mathrm{CTL}^{*}\) based on tableaux and automata
• Controlled finite automata
• scientific article; zbMATH DE number 3453519

Cited in

(5)

• The Common Fragment of ACTL and LTL
• scientific article; zbMATH DE number 7215285 (Why is no real title available?)
• Computing sufficient and necessary conditions in CTL: a forgetting approach
• Automata-theoretic characterisations of branching-time temporal logics
• On the Way to Alternating Weak Automata

This page was built for publication: Automaton-Based Criteria for Membership in CTL

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