scientific article
From MaRDI portal
Publication:3384171
zbMath1483.68177arXiv1709.02102MaRDI QIDQ3384171
Publication date: 14 December 2021
Full work available at URL: https://arxiv.org/abs/1709.02102
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (7)
Determinization and limit-determinization of Emerson-Lei automata ⋮ From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ Dissecting \texttt{ltlsynt} ⋮ LTL to self-loop alternating automata with generic acceptance and back ⋮ Generic Emptiness Check for Fun and Profit ⋮ Practical synthesis of reactive systems from LTL specifications via parity games ⋮ Delag
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
- From LTL to deterministic automata. A safraless compositional approach
- Computer science logic. 20th international workshop, CSL 2006, 15th annual conference of the EACSL, Szeged, Hungary, September 25--29, 2006. Proceedings.
- An Improved Construction of Deterministic Omega-automaton Using Derivatives
- From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Tighter Bounds for the Determinisation of Büchi Automata
- The complexity of probabilistic verification
- Markov Chains and Unambiguous Büchi Automata
- Limit-Deterministic Büchi Automata for Linear Temporal Logic
- Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment
- Lazy probabilistic model checking without determinisation
- A Modular Approach for Büchi Determinization.
- Are Good-for-Games Automata Good for Probabilistic Model Checking?
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- From LTL to Symbolically Represented Deterministic Automata
- Safraless Compositional Synthesis
This page was built for publication:
