Guessing winning policies in LTL synthesis by semantic learning

DOI10.1007/978-3-031-37706-8_20zbMATH Open1547.68435MaRDI QIDQ6535642FDOQ6535642

Authors: Jan Křetínský, Tobias Meggendorfer, Maximilian Prokop, Sabine Rieder 

Publication date: 1 February 2024

Recommendations

• Semantic labelling and learning for parity game solving in LTL synthesis
• scientific article; zbMATH DE number 7455738
• LTL reactive synthesis with a few hints
• Tools and Algorithms for the Construction and Analysis of Systems
• A Hybrid Algorithm for LTL Games

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• Solving parity games in practice
• Scikit-learn: machine learning in Python
• Practical synthesis of reactive systems from LTL specifications via parity games
• Rabinizer 3: Safraless translation of LTL to small deterministic automata
• Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
• Rabinizer 2: small deterministic automata for \(\mathrm{LTL}_{ \setminus\mathbf{GU}}\)
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Title not available (Why is that?)
• Tighter Bounds for the Determinisation of Büchi Automata
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Title not available (Why is that?)
• Permissive strategies: from parity games to safety games
• A Unified Translation of Linear Temporal Logic to ω-Automata
• Owl: a library for \(\omega \)-words, automata, and LTL
• Title not available (Why is that?)
• Limit-deterministic Büchi automata for linear temporal logic
• From LTL to deterministic automata. A safraless compositional approach
• Efficient parallel strategy improvement for parity games
• Solving Parity Games on the GPU
• One theorem to rule them all: a unified translation of LTL into \(\omega \)-automata
• From LTL and limit-deterministic Büchi automata to deterministic parity automata
• Index appearance record with preorders
• Semantic labelling and learning for parity game solving in LTL synthesis
• Deciding Parity Games in Quasi-polynomial Time
• Guessing winning policies in LTL synthesis by semantic learning

Cited In (1)

• Guessing winning policies in LTL synthesis by semantic learning

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)