Reasoning about Quality and Fuzziness of Strategic Behaviors
From MaRDI portal
Publication:6116358
Abstract: Temporal logics are extensively used for the specification of on-going behaviours of reactive systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification of on-going strategic behaviours in multi-agent systems, and the transition of temporal logics to a quantitative setting, where different satisfaction values enable the specifier to formalise concepts such as certainty or quality. We introduce and study FSL---a quantitative extension of SL (Strategy Logic), one of the most natural and expressive logics describing strategic behaviours. The satisfaction value of an FSL formula is a real value in [0,1], reflecting `how much' or `how well' the strategic on-going objectives of the underlying agents are satisfied. We demonstrate the applications of FSL in quantitative reasoning about multi-agent systems, by showing how it can express concepts of stability in multi-agent systems, and how it generalises some fuzzy temporal logics. We also provide a model-checking algorithm for our logic, based on a quantitative extension of Quantified CTL*.
Cites work
- Admissibility in Infinite Games
- Algorithmic Game Theory
- Algorithmic mechanism design (extended abstract)
- Alternating-time temporal logic
- An automata-theoretic approach to branching-time model checking
- Assume-admissible synthesis
- Augmenting ATL with strategy contexts
- Augmenting branching temporal logics with existential quantification over atomic propositions
- Automata-theoretic techniques for modal logics of programs
- Averaging in LTL
- Computation, logic, philosophy. A collection of essays
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Discounting in LTL
- Formally reasoning about quality
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Fuzzy languages
- Fuzzy Time in Linear Temporal Logic
- Games with secure equilibria
- Graded modalities in strategy logic
- High-Quality Synthesis Against Stochastic Environments
- How much can taxes help selfish routing?
- How to be both rich and happy: combining quantitative and qualitative strategic reasoning about multi-player games (extended abstract)
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 5366670 (Why is no real title available?)
- scientific article; zbMATH DE number 5485518 (Why is no real title available?)
- scientific article; zbMATH DE number 3930354 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (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 6862070 (Why is no real title available?)
- scientific article; zbMATH DE number 7297884 (Why is no real title available?)
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Latticed-LTL synthesis in the presence of noisy inputs
- MK-fuzzy automata and MSO logics
- Modalities for model checking: Branching time logic strikes back
- Model checking discounted temporal properties
- Model-Checking Timed ATL for Durational Concurrent Game Structures
- On equilibria in quantitative games with reachability/safety objectives
- On synthesizing robust discrete controllers under modeling uncertainty
- On the complexity of model-checking branching and alternating-time temporal logics in one-counter systems
- Positional strategies for mean payoff games
- Quantified CTL: expressiveness and complexity
- Quantifying Bounds in Strategy Logic
- Quantitative assume guarantee synthesis
- Rational synthesis
- Reasoning about strategies: on the model-checking problem
- Robust discrete synthesis against unspecified disturbances
- Robust equilibria in mean-payoff games
- Secure equilibria in weighted games
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Stochastic game logic
- Stochastic Games
- Strategy logic
- Synthesis with rational environments
- Temporal specifications with accumulative values
- The complexity of mean payoff games on graphs
- The temporal semantics of concurrent programs
- Timed Alternating-Time Temporal Logic
- Timed Concurrent Game Structures
- Weighted Strategy Logic with Boolean Goals Over One-Counter Games.
- What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
- “Sometimes” and “not never” revisited
Cited in
(8)- Strategic Vagueness, and Appropriate Contexts
- Rationalizable Strategic Behavior
- The complexity of LTL rational synthesis
- Robust alternating-time temporal logic
- Gödel-Dummett linear temporal logic
- Characterising and verifying the core in concurrent multi-player mean-payoff games
- Incremental model checking for fuzzy computation tree logic
- Formal verification and synthesis of mechanisms for social choice
This page was built for publication: Reasoning about Quality and Fuzziness of Strategic Behaviors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6116358)
