Automaton-Based Criteria for Membership in CTL

DOI10.1145/3209108.3209143zbMATH Open1497.68250OpenAlexW2798742893MaRDI QIDQ5145288FDOQ5145288

Yariv Shaulian, Udi Boker

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)

Cited In (2)

• Title not available (Why is that?)
• On the Way to Alternating Weak Automata

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An Automata-based Approach for CTL⋆ With Constraints 👍 👎
• A Decision Procedure for CTL* Based on Tableaux and Automata 👍 👎
• Controlled finite automata 👍 👎
• Finite automata with generalized acceptance criteria 👍 👎
• Automata-Based CSL Model Checking 👍 👎
• Model checking CTL over restricted classes of automatic structures 👍 👎
• Testing Membership in Counter Automaton Languages 👍 👎

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)