Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis

DOI10.1007/978-3-030-31784-3_24zbMath1437.68118arXiv1907.12157OpenAlexW2981602668MaRDI QIDQ3297602

Alexander Manta, Tobias Meggendorfer, Jan Křetínský

Publication date: 20 July 2020

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.12157

Mathematics Subject Classification ID

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

Related Items

Index appearance record with preorders, Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis, Unnamed Item

Uses Software

• SPOT
• PGSolver
• Acacia+
• Strix
• Oink
• BoSy

Cites Work

• Unnamed Item
• Unnamed Item
• Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
• On the structure of non-manipulable equilibria
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Efficient parallel strategy improvement for parity games
• An automaton learning approach to solving safety games over infinite graphs
• From LTL to deterministic automata. A safraless compositional approach
• LTL receding horizon control for finite deterministic systems
• Towards Efficient Parameterized Synthesis
• Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis
• From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
• On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
• Bounded Synthesis
• Tighter Bounds for the Determinisation of Büchi Automata
• Solving Parity Games in Practice
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Solving Parity Games in Big Steps