Guessing winning policies in LTL synthesis by semantic learning
From MaRDI portal
Publication:6535642
Recommendations
Cites work
- scientific article; zbMATH DE number 6527944 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 7471697 (Why is no real title available?)
- A Unified Translation of Linear Temporal Logic to ω-Automata
- Deciding Parity Games in Quasi-polynomial Time
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Efficient parallel strategy improvement for parity games
- From LTL and limit-deterministic Büchi automata to deterministic parity automata
- From LTL to deterministic automata. A safraless compositional approach
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Guessing winning policies in LTL synthesis by semantic learning
- Index appearance record with preorders
- Limit-deterministic Büchi automata for linear temporal logic
- One theorem to rule them all: a unified translation of LTL into \(\omega \)-automata
- Owl: a library for \(\omega \)-words, automata, and LTL
- Permissive strategies: from parity games to safety games
- Practical synthesis of reactive systems from LTL specifications via parity games
- Rabinizer 2: small deterministic automata for \(\mathrm{LTL}_{ \setminus\mathbf{GU}}\)
- Rabinizer 3: Safraless translation of LTL to small deterministic automata
- Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
- Scikit-learn: machine learning in Python
- Semantic labelling and learning for parity game solving in LTL synthesis
- Solving Parity Games on the GPU
- Solving parity games in practice
- Tighter Bounds for the Determinisation of Büchi Automata
This page was built for publication: Guessing winning policies in LTL synthesis by semantic learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535642)
