Uniform inevitability is tree automaton ineffable
DOI10.1016/0020-0190(87)90097-4zbMATH Open0653.68079OpenAlexW2061141623MaRDI QIDQ1108048FDOQ1108048
Authors: E. Allen Emerson 
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90097-4
Recommendations
temporal logicexpressive powertree automatonMuller automatacorrectness of concurrent programsfinite automata on infinite treesuniform inevitability
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- Propositional dynamic logic of looping and converse is elementarily decidable
- Results on the propositional \(\mu\)-calculus
- “Sometimes” and “not never” revisited
- Title not available (Why is that?)
- Deciding full branching time logic
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Automated temporal reasoning about reactive systems
- Infinite trees and automaton-definable relations over \(\omega\)-words
- Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
- Title not available (Why is that?)
- Automata on infinite objects and their applications to logic and programming
- Temporal Logic with Recursion.
- To know or not to know: Epistemic approaches to security protocol verification
- Temporal logic with recursion
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- The complexity of model-checking tail-recursive higher-order fixpoint logic
This page was built for publication: Uniform inevitability is tree automaton ineffable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108048)
