Experiments with deterministic -automata for formulas of linear temporal logic
From MaRDI portal
(Redirected from Publication:860862)
Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
Recommendations
- Implementation and Application of Automata
- Generating deterministic \(\omega\)-automata for most LTL formulas by the breakpoint construction
- From LTL to Symbolically Represented Deterministic Automata
- From LTL to deterministic automata. A safraless compositional approach
- scientific article; zbMATH DE number 1786477
Cites work
- scientific article; zbMATH DE number 1670781 (Why is no real title available?)
- scientific article; zbMATH DE number 1982198 (Why is no real title available?)
- scientific article; zbMATH DE number 1500643 (Why is no real title available?)
- scientific article; zbMATH DE number 1555955 (Why is no real title available?)
- scientific article; zbMATH DE number 1754630 (Why is no real title available?)
- scientific article; zbMATH DE number 1759609 (Why is no real title available?)
- scientific article; zbMATH DE number 1796123 (Why is no real title available?)
- scientific article; zbMATH DE number 2102704 (Why is no real title available?)
- scientific article; zbMATH DE number 1392310 (Why is no real title available?)
- scientific article; zbMATH DE number 7280017 (Why is no real title available?)
- Automata, logics, and infinite games. A guide to current research
- Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata
- Deciding full branching time logic
- Efficient minimization of deterministic weak \(\omega\)-automata
- Implementation and Application of Automata
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Three Partition Refinement Algorithms
- ``More deterministic vs. ``smaller Büchi automata for efficient LTL model checking
Cited in
(25)- Functional encryption for inner product with full function privacy
- Generic emptiness check for fun and profit
- Owl: a library for \(\omega \)-words, automata, and LTL
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
- An improved construction of deterministic omega-automaton using derivatives
- LTL to deterministic Emerson-Lei automata
- From LTL to deterministic automata. A safraless compositional approach
- scientific article; zbMATH DE number 1786477 (Why is no real title available?)
- scientific article; zbMATH DE number 2102710 (Why is no real title available?)
- Minimal counterexamples for linear-time probabilistic verification
- On the power of automata minimization in reactive synthesis
- State of Büchi complementation
- LTL semantic tableaux and alternating \(\omega\)-automata via linear factors
- Implementation and Application of Automata
- From LTL to Symbolically Represented Deterministic Automata
- Optimal Translation of LTL to Limit Deterministic Automata
- Generating deterministic \(\omega\)-automata for most LTL formulas by the breakpoint construction
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
- Back to the future: a fresh look at linear temporal logic
- GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic
- Markov chains and unambiguous automata
- Index appearance record with preorders
- Semantic labelling and learning for parity game solving in LTL synthesis
- Index appearance record for transforming Rabin automata into parity automata
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
This page was built for publication: Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860862)
