Quantifying Bounds in Strategy Logic

DOI10.4230/LIPICS.CSL.2018.23MaRDI QIDQ5079747zbMATH OpenOpenAlexFDO

Authors Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin

Publication date 28 May 2022

Full work available at URL https://dblp.uni-trier.de/db/conf/csl/csl2018.html#FijalkowMMR18

zbMATH Keywords

automata with countersmodel checkingprompt LTLstrategy logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• Reasoning about strategies: on the model-checking problem
• Reasoning about strategies: on the satisfiability problem
• On the boundary of behavioral strategies
• Better Quality in Synthesis through Quantitative Objectives
• Model checking and synthesis for branching multi-weighted logics

Cites work

• Alternating-time temporal logic
• An automata-theoretic approach to branching-time model checking
• Asynchronous announcements in a public channel
• Augmenting ATL with strategy contexts
• Augmenting branching temporal logics with existential quantification over atomic propositions
• Cost-parity and cost-Streett games
• Finitary winning in \({\omega}\)-regular games
• From liveness to promptness
• Functional analysis
• Graded computation tree logic
• How good is a strategy in a game with Nature?
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 2084388 (Why is no real title available?)
• scientific article; zbMATH DE number 1759605 (Why is no real title available?)
• scientific article; zbMATH DE number 7297884 (Why is no real title available?)
• Infinite-state games with finitary conditions
• Linear temporal logic for regular cost functions
• On promptness in parity games
• On the Expressive Power of Cost Logics over Infinite Words
• Parametric temporal logic for “model measuring”
• Parity and Streett games with costs
• Promptness in \(\omega \)-regular automata
• Quantified CTL: expressiveness and complexity
• Reasoning about strategies: on the model-checking problem
• Regular cost functions. I: Logic and algebra over words
• Solving Games Without Determinization
• Strategy logic
• Synthesis with rational environments
• The bridge between regular cost functions and omega-regular languages
• The temporal logic of branching time
• The Theory of Stabilisation Monoids and Regular Cost Functions
• Trading bounds for memory in games with counters
• Weighted Strategy Logic with Boolean Goals Over One-Counter Games.

Cited in

(7)

• A logic of strategic ability under bounded memory
• Dependences in strategy logic
• Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism
• Model Checking Logics of Strategic Ability: Complexity*
• Strategies of the search for derivation of statements with restricted quantifiers
• Weighted Strategy Logic with Boolean Goals Over One-Counter Games.
• Reasoning about Quality and Fuzziness of Strategic Behaviors

This page was built for publication: Quantifying Bounds in Strategy Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079747)