Back to the future: a fresh look at linear temporal logic
From MaRDI portal
Publication:2117656
Cites work
- scientific article; zbMATH DE number 3940713 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata
- Automata-theoretic techniques for modal logics of programs
- Characterization of temporal property classes
- Completing the temporal picture
- Experiments with deterministic -automata for formulas of linear temporal logic
- From LTL to deterministic automata. A safraless compositional approach
- Handbook of model checking
- Implementation and Application of Automata
- On the Krohn-Rhodes cascaded decomposition theorem
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
- One theorem to rule them all: a unified translation of LTL into \(\omega \)-automata
- Owl: a library for \(\omega \)-words, automata, and LTL
- Practical synthesis of reactive systems from LTL specifications via parity games
- Rabinizer 2: small deterministic automata for \(\mathrm{LTL}_{ \setminus\mathbf{GU}}\)
- Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
- Strix
- Temporal verification of reactive systems: response
- The complexity of probabilistic verification
- The temporal semantics of concurrent programs
Cited in
(2)
This page was built for publication: Back to the future: a fresh look at linear temporal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117656)
