Realizability problem for constraint LTL

DOI10.1016/j.ic.2023.105126arXiv2207.06708OpenAlexW4388968637MaRDI QIDQ6178458

M. Praveen, Ashwin Bhaskar

Publication date: 18 January 2024

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

realizabilitytree automataconstraint LTLstrategy trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An automata-theoretic approach to constraint LTL
• From liveness to promptness
• The complementation problem for Büchi automata with applications to temporal logic
• Finite-memory automata
• Automata, logics, and infinite games. A guide to current research
• Reactive synthesis from interval temporal logic specifications
• Parameterized synthesis for fragments of first-order logic over data words
• Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution
• Reasoning about Data Repetitions with Counter Systems
• Solving Parity Games on Integer Vectors
• LTL with the freeze quantifier and register automata
• Two-variable logic on data words
• Temporal Logics of Repeating Values
• Playing with Repetitions in Data Words Using Energy Games
• Decidable Extensions of Church’s Problem
• A really temporal logic
• Infinite Games
• Nondeterministic Tree Automata
• Deciding Parity Games in Quasi-polynomial Time
• Computer Science Logic
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Realizability problem for constraint LTL