The complexity of LTL rational synthesis
type: Item
instance of: scholarly article
title: The complexity of LTL rational synthesis
zbMATH Open document ID: 1547.68436
DOI: 10.1007/978-3-030-99524-9_2
author: Orna Kupferman
author: Noam Shenwald
publication date: 2024-01-23T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 7793087
MaRDI profile type: Publication
cites work: Alternating-time temporal logic
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: Reasoning about Quality and Fuzziness of Strategic Behaviors
cites work: Environment Assumptions for Synthesis
cites work: Strategy Logic
cites work: Computer Science Logic
cites work: Q5725991
cites work: The Complexity of Rational Synthesis
cites work: Rational Synthesis
cites work: Imperfect information in reactive modules games
cites work: Q3113724
cites work: Synthesis with rational environments
cites work: Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
cites work: Equilibrium points in n -person games
cites work: Algorithmic Game Theory
cites work: Algorithms, games, and the internet
cites work: The temporal semantics of concurrent programs
cites work: Q4205072
cites work: Automata-theoretic techniques for modal logics of programs
description: scientific article; zbMATH DE number 7793087