The complexity of traversing automata with current state uncertainty under LTL_f constraints
From MaRDI portal
Publication:6907605
Cites work
- \(\mathrm{LTL}_{f}\) satisfiability checking
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
- Combinatorics, Words and Symbolic Dynamics
- Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Languages of R-trivial monoids
- LTL on finite and process traces: complexity results and a practical reasoner
- Nesting until and since in linear temporal logic
- Past is for free: On the complexity of verifying linear temporal properties with past
- Reducibility among combinatorial problems
- Reset Sequences for Monotonic Automata
- Subset synchronization in monotonic automata
- Synchronization of automata with one undefined or ambiguous transition
- Synchronization problems in automata without non-trivial cycles
- Synchronizing Automata and the Černý Conjecture
- Synchronizing monotonic automata
- Synchronizing words under \textsf{LTL} constraints
- The complexity of propositional linear temporal logics
- The complexity of propositional linear temporal logics in simple cases
- The temporal semantics of concurrent programs
- Černý's conjecture and the road colouring problem
This page was built for publication: The complexity of traversing automata with current state uncertainty under \(\mathrm{LTL}_{f}\) constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907605)
