Guessing winning policies in LTL synthesis by semantic learning
From MaRDI portal
Publication:6535642
DOI10.1007/978-3-031-37706-8_20zbMATH Open1547.68435MaRDI QIDQ6535642
Jan Křetínský, Maximilian Prokop, Sabine Rieder, Tobias Meggendorfer
Publication date: 1 February 2024
Computational learning theory (68Q32) Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Efficient parallel strategy improvement for parity games
- Practical synthesis of reactive systems from LTL specifications via parity games
- From LTL to deterministic automata. A safraless compositional approach
- Index appearance record with preorders
- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis
- From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
- Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata
- Tighter Bounds for the Determinisation of Büchi Automata
- Solving Parity Games in Practice
- Limit-Deterministic Büchi Automata for Linear Temporal Logic
- Rabinizer: Small Deterministic Automata for LTL(F,G)
- Permissive strategies: from parity games to safety games
- A Unified Translation of Linear Temporal Logic to ω-Automata
- Deciding Parity Games in Quasi-polynomial Time
- One Theorem to Rule Them All
- Rabinizer 2: Small Deterministic Automata for LTL ∖ GU
- Solving Parity Games on the GPU
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Owl: a library for \(\omega \)-words, automata, and LTL
- Guessing winning policies in LTL synthesis by semantic learning
Related Items (1)
This page was built for publication: Guessing winning policies in LTL synthesis by semantic learning
