Loading…

Reasoning about Quality and Fuzziness of Strategic Behaviors

Temporal logics are extensively used for the specification of on-going behaviors of computer systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification of on-going strategic behaviors in multi-agent systems, and t...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on computational logic 2023-07, Vol.24 (3), p.1-38, Article 21
Main Authors: Bouyer, Patricia, Kupferman, Orna, Markey, Nicolas, Maubert, Bastien, Murano, Aniello, Perelli, Giuseppe
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-a273t-938a276347e5e230a558da5d9556e88e632154d1bb4a55de1669c7025fd9bf033
container_end_page 38
container_issue 3
container_start_page 1
container_title ACM transactions on computational logic
container_volume 24
creator Bouyer, Patricia
Kupferman, Orna
Markey, Nicolas
Maubert, Bastien
Murano, Aniello
Perelli, Giuseppe
description Temporal logics are extensively used for the specification of on-going behaviors of computer systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification of on-going strategic behaviors in multi-agent systems, and the transition of temporal logics to a quantitative setting, where different satisfaction values enable the specifier to formalize concepts such as certainty or quality. In the first class, SL (Strategy Logic) is one of the most natural and expressive logics describing strategic behaviors. In the second class, a notable logic is LTL[ℱ] , which extends LTL with quality operators.In this work, we introduce and study SL[ℱ] , which enables the specification of quantitative strategic behaviors. The satisfaction value of an SL[ℱ] 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 SL[ℱ] in quantitative reasoning about multi-agent systems, showing how it can express and measure concepts like stability in multi-agent systems, and how it generalizes some fuzzy temporal logics. We also provide a model-checking algorithm for SL[ℱ] , based on a quantitative extension of Quantified CTL⋆ . Our algorithm provides the first decidability result for a quantitative extension of Strategy Logic. In addition, it can be used for synthesizing strategies that maximize the quality of the systems’ behavior.
doi_str_mv 10.1145/3582498
format article
fullrecord <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_04219131v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_04219131v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-a273t-938a276347e5e230a558da5d9556e88e632154d1bb4a55de1669c7025fd9bf033</originalsourceid><addsrcrecordid>eNo9kM1Lw0AQxRdRsFbx7mlv4iG6s7uT7IKXWlorFMQv8BYmyaZdaRPJpoX2rzeltad5zPvNPHiMXYO4B9D4oNBIbc0J6wFiElmN36c7LW2kEoPn7CKEHyFAJkr22OO7o1BXvppxyupVy99WtPDthlNV8PFqu_WVC4HXJf9oG2rdzOf8yc1p7esmXLKzkhbBXR1mn32NR5_DSTR9fX4ZDqYRdSFtZJXpRKx04tBJJQjRFISFRYydMS5WElAXkGW6swoHcWzzREgsC5uVQqk-u9v_ndMi_W38kppNWpNPJ4NputsJLcGCgjV07O2ezZs6hMaVxwMQ6a6g9FBQR97sScqXR-jf_AOO9l4W</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Reasoning about Quality and Fuzziness of Strategic Behaviors</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Bouyer, Patricia ; Kupferman, Orna ; Markey, Nicolas ; Maubert, Bastien ; Murano, Aniello ; Perelli, Giuseppe</creator><creatorcontrib>Bouyer, Patricia ; Kupferman, Orna ; Markey, Nicolas ; Maubert, Bastien ; Murano, Aniello ; Perelli, Giuseppe</creatorcontrib><description>Temporal logics are extensively used for the specification of on-going behaviors of computer systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification of on-going strategic behaviors in multi-agent systems, and the transition of temporal logics to a quantitative setting, where different satisfaction values enable the specifier to formalize concepts such as certainty or quality. In the first class, SL (Strategy Logic) is one of the most natural and expressive logics describing strategic behaviors. In the second class, a notable logic is LTL[ℱ] , which extends LTL with quality operators.In this work, we introduce and study SL[ℱ] , which enables the specification of quantitative strategic behaviors. The satisfaction value of an SL[ℱ] 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 SL[ℱ] in quantitative reasoning about multi-agent systems, showing how it can express and measure concepts like stability in multi-agent systems, and how it generalizes some fuzzy temporal logics. We also provide a model-checking algorithm for SL[ℱ] , based on a quantitative extension of Quantified CTL⋆ . Our algorithm provides the first decidability result for a quantitative extension of Strategy Logic. In addition, it can be used for synthesizing strategies that maximize the quality of the systems’ behavior.</description><identifier>ISSN: 1529-3785</identifier><identifier>EISSN: 1557-945X</identifier><identifier>DOI: 10.1145/3582498</identifier><language>eng</language><publisher>New York, NY: ACM</publisher><subject>Automata over infinite objects ; Computer Science ; Logic and verification ; Modal and temporal logics ; Theory of computation ; Tree languages ; Verification by model checking</subject><ispartof>ACM transactions on computational logic, 2023-07, Vol.24 (3), p.1-38, Article 21</ispartof><rights>Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from</rights><rights>Attribution</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-a273t-938a276347e5e230a558da5d9556e88e632154d1bb4a55de1669c7025fd9bf033</cites><orcidid>0000-0002-9081-2920 ; 0000-0003-4699-6117 ; 0000-0003-4876-3448 ; 0000-0003-1977-7525 ; 0000-0002-8687-6323 ; 0000-0002-2823-0911</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,776,780,881,27901,27902</link.rule.ids><backlink>$$Uhttps://inria.hal.science/hal-04219131$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Bouyer, Patricia</creatorcontrib><creatorcontrib>Kupferman, Orna</creatorcontrib><creatorcontrib>Markey, Nicolas</creatorcontrib><creatorcontrib>Maubert, Bastien</creatorcontrib><creatorcontrib>Murano, Aniello</creatorcontrib><creatorcontrib>Perelli, Giuseppe</creatorcontrib><title>Reasoning about Quality and Fuzziness of Strategic Behaviors</title><title>ACM transactions on computational logic</title><addtitle>ACM TOCL</addtitle><description>Temporal logics are extensively used for the specification of on-going behaviors of computer systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification of on-going strategic behaviors in multi-agent systems, and the transition of temporal logics to a quantitative setting, where different satisfaction values enable the specifier to formalize concepts such as certainty or quality. In the first class, SL (Strategy Logic) is one of the most natural and expressive logics describing strategic behaviors. In the second class, a notable logic is LTL[ℱ] , which extends LTL with quality operators.In this work, we introduce and study SL[ℱ] , which enables the specification of quantitative strategic behaviors. The satisfaction value of an SL[ℱ] 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 SL[ℱ] in quantitative reasoning about multi-agent systems, showing how it can express and measure concepts like stability in multi-agent systems, and how it generalizes some fuzzy temporal logics. We also provide a model-checking algorithm for SL[ℱ] , based on a quantitative extension of Quantified CTL⋆ . Our algorithm provides the first decidability result for a quantitative extension of Strategy Logic. In addition, it can be used for synthesizing strategies that maximize the quality of the systems’ behavior.</description><subject>Automata over infinite objects</subject><subject>Computer Science</subject><subject>Logic and verification</subject><subject>Modal and temporal logics</subject><subject>Theory of computation</subject><subject>Tree languages</subject><subject>Verification by model checking</subject><issn>1529-3785</issn><issn>1557-945X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNo9kM1Lw0AQxRdRsFbx7mlv4iG6s7uT7IKXWlorFMQv8BYmyaZdaRPJpoX2rzeltad5zPvNPHiMXYO4B9D4oNBIbc0J6wFiElmN36c7LW2kEoPn7CKEHyFAJkr22OO7o1BXvppxyupVy99WtPDthlNV8PFqu_WVC4HXJf9oG2rdzOf8yc1p7esmXLKzkhbBXR1mn32NR5_DSTR9fX4ZDqYRdSFtZJXpRKx04tBJJQjRFISFRYydMS5WElAXkGW6swoHcWzzREgsC5uVQqk-u9v_ndMi_W38kppNWpNPJ4NputsJLcGCgjV07O2ezZs6hMaVxwMQ6a6g9FBQR97sScqXR-jf_AOO9l4W</recordid><startdate>20230731</startdate><enddate>20230731</enddate><creator>Bouyer, Patricia</creator><creator>Kupferman, Orna</creator><creator>Markey, Nicolas</creator><creator>Maubert, Bastien</creator><creator>Murano, Aniello</creator><creator>Perelli, Giuseppe</creator><general>ACM</general><general>Association for Computing Machinery</general><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-9081-2920</orcidid><orcidid>https://orcid.org/0000-0003-4699-6117</orcidid><orcidid>https://orcid.org/0000-0003-4876-3448</orcidid><orcidid>https://orcid.org/0000-0003-1977-7525</orcidid><orcidid>https://orcid.org/0000-0002-8687-6323</orcidid><orcidid>https://orcid.org/0000-0002-2823-0911</orcidid></search><sort><creationdate>20230731</creationdate><title>Reasoning about Quality and Fuzziness of Strategic Behaviors</title><author>Bouyer, Patricia ; Kupferman, Orna ; Markey, Nicolas ; Maubert, Bastien ; Murano, Aniello ; Perelli, Giuseppe</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a273t-938a276347e5e230a558da5d9556e88e632154d1bb4a55de1669c7025fd9bf033</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Automata over infinite objects</topic><topic>Computer Science</topic><topic>Logic and verification</topic><topic>Modal and temporal logics</topic><topic>Theory of computation</topic><topic>Tree languages</topic><topic>Verification by model checking</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bouyer, Patricia</creatorcontrib><creatorcontrib>Kupferman, Orna</creatorcontrib><creatorcontrib>Markey, Nicolas</creatorcontrib><creatorcontrib>Maubert, Bastien</creatorcontrib><creatorcontrib>Murano, Aniello</creatorcontrib><creatorcontrib>Perelli, Giuseppe</creatorcontrib><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>ACM transactions on computational logic</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bouyer, Patricia</au><au>Kupferman, Orna</au><au>Markey, Nicolas</au><au>Maubert, Bastien</au><au>Murano, Aniello</au><au>Perelli, Giuseppe</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reasoning about Quality and Fuzziness of Strategic Behaviors</atitle><jtitle>ACM transactions on computational logic</jtitle><stitle>ACM TOCL</stitle><date>2023-07-31</date><risdate>2023</risdate><volume>24</volume><issue>3</issue><spage>1</spage><epage>38</epage><pages>1-38</pages><artnum>21</artnum><issn>1529-3785</issn><eissn>1557-945X</eissn><abstract>Temporal logics are extensively used for the specification of on-going behaviors of computer systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification of on-going strategic behaviors in multi-agent systems, and the transition of temporal logics to a quantitative setting, where different satisfaction values enable the specifier to formalize concepts such as certainty or quality. In the first class, SL (Strategy Logic) is one of the most natural and expressive logics describing strategic behaviors. In the second class, a notable logic is LTL[ℱ] , which extends LTL with quality operators.In this work, we introduce and study SL[ℱ] , which enables the specification of quantitative strategic behaviors. The satisfaction value of an SL[ℱ] 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 SL[ℱ] in quantitative reasoning about multi-agent systems, showing how it can express and measure concepts like stability in multi-agent systems, and how it generalizes some fuzzy temporal logics. We also provide a model-checking algorithm for SL[ℱ] , based on a quantitative extension of Quantified CTL⋆ . Our algorithm provides the first decidability result for a quantitative extension of Strategy Logic. In addition, it can be used for synthesizing strategies that maximize the quality of the systems’ behavior.</abstract><cop>New York, NY</cop><pub>ACM</pub><doi>10.1145/3582498</doi><tpages>38</tpages><orcidid>https://orcid.org/0000-0002-9081-2920</orcidid><orcidid>https://orcid.org/0000-0003-4699-6117</orcidid><orcidid>https://orcid.org/0000-0003-4876-3448</orcidid><orcidid>https://orcid.org/0000-0003-1977-7525</orcidid><orcidid>https://orcid.org/0000-0002-8687-6323</orcidid><orcidid>https://orcid.org/0000-0002-2823-0911</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1529-3785
ispartof ACM transactions on computational logic, 2023-07, Vol.24 (3), p.1-38, Article 21
issn 1529-3785
1557-945X
language eng
recordid cdi_hal_primary_oai_HAL_hal_04219131v1
source Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)
subjects Automata over infinite objects
Computer Science
Logic and verification
Modal and temporal logics
Theory of computation
Tree languages
Verification by model checking
title Reasoning about Quality and Fuzziness of Strategic Behaviors
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T16%3A37%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Reasoning%20about%20Quality%20and%20Fuzziness%20of%20Strategic%20Behaviors&rft.jtitle=ACM%20transactions%20on%20computational%20logic&rft.au=Bouyer,%20Patricia&rft.date=2023-07-31&rft.volume=24&rft.issue=3&rft.spage=1&rft.epage=38&rft.pages=1-38&rft.artnum=21&rft.issn=1529-3785&rft.eissn=1557-945X&rft_id=info:doi/10.1145/3582498&rft_dat=%3Chal_cross%3Eoai_HAL_hal_04219131v1%3C/hal_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a273t-938a276347e5e230a558da5d9556e88e632154d1bb4a55de1669c7025fd9bf033%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true