Stubborn Set Reduction for Two-Player Reachability Games

Stubborn Set Reduction for Two-Player Reachability Games

Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2021-03
Hauptverfasser: Frederik Meyer Bønneland, Jensen, Peter Gjøl, Larsen, Kim Guldstrand, Muñiz, Marco, Srba, Jiří
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Logic in Computer Science
Games
Petri nets
Reduction
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Frederik Meyer Bønneland
Jensen, Peter Gjøl
Larsen, Kim Guldstrand
Muñiz, Marco
Srba, Jiří
description Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability objectives. Our stubborn reduction allows us to prune the interleaving behaviour of both players in the game, and we formally prove its correctness on the class of games played on general labelled transition systems. We then instantiate the framework to the class of weighted Petri net games with inhibitor arcs and provide its efficient implementation in the model checker TAPAAL. Finally, we evaluate our stubborn reduction on several case studies and demonstrate its efficiency.
doi_str_mv 10.48550/arxiv.1912.09875
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1912_09875</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2329991262</sourcerecordid><originalsourceid>FETCH-LOGICAL-a955-ef90f2afd1a7b5b245c087f449d442a9c9a8c27893a9afc9a211ed1b91c7425d3</originalsourceid><addsrcrecordid>eNotj1FLwzAUhYMgOOZ-gE8WfO5MbpIleZShUxgoru_lJk2wo2tm2qr999bNp8vhfhzOR8gNo0uhpaT3mH7qryUzDJbUaCUvyAw4Z7kWAFdk0XV7SimsFEjJZ0Tv-sHamNps5_vs3VeD6-vYZiGmrPiO-VuDo0_TA90H2rqp-zHb4MF31-QyYNP5xf-dk-LpsVg_59vXzcv6YZujkTL3wdAAGCqGykoLQjqqVRDCVEIAGmdQO1DacDQYpgSM-YpZw5wSICs-J7fn2pNWeUz1AdNY_umVJ72JuDsTxxQ_B9_15T4OqZ02lcDBmIlcAf8F1lZR5w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2329991262</pqid></control><display><type>article</type><title>Stubborn Set Reduction for Two-Player Reachability Games</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Frederik Meyer Bønneland ; Jensen, Peter Gjøl ; Larsen, Kim Guldstrand ; Muñiz, Marco ; Srba, Jiří</creator><creatorcontrib>Frederik Meyer Bønneland ; Jensen, Peter Gjøl ; Larsen, Kim Guldstrand ; Muñiz, Marco ; Srba, Jiří</creatorcontrib><description>Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability objectives. Our stubborn reduction allows us to prune the interleaving behaviour of both players in the game, and we formally prove its correctness on the class of games played on general labelled transition systems. We then instantiate the framework to the class of weighted Petri net games with inhibitor arcs and provide its efficient implementation in the model checker TAPAAL. Finally, we evaluate our stubborn reduction on several case studies and demonstrate its efficiency.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1912.09875</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computer Science - Logic in Computer Science ; Games ; Petri nets ; Reduction</subject><ispartof>arXiv.org, 2021-03</ispartof><rights>2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.23638/LMCS-17(1:21)2021$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1912.09875$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Frederik Meyer Bønneland</creatorcontrib><creatorcontrib>Jensen, Peter Gjøl</creatorcontrib><creatorcontrib>Larsen, Kim Guldstrand</creatorcontrib><creatorcontrib>Muñiz, Marco</creatorcontrib><creatorcontrib>Srba, Jiří</creatorcontrib><title>Stubborn Set Reduction for Two-Player Reachability Games</title><title>arXiv.org</title><description>Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability objectives. Our stubborn reduction allows us to prune the interleaving behaviour of both players in the game, and we formally prove its correctness on the class of games played on general labelled transition systems. We then instantiate the framework to the class of weighted Petri net games with inhibitor arcs and provide its efficient implementation in the model checker TAPAAL. Finally, we evaluate our stubborn reduction on several case studies and demonstrate its efficiency.</description><subject>Computer Science - Logic in Computer Science</subject><subject>Games</subject><subject>Petri nets</subject><subject>Reduction</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj1FLwzAUhYMgOOZ-gE8WfO5MbpIleZShUxgoru_lJk2wo2tm2qr999bNp8vhfhzOR8gNo0uhpaT3mH7qryUzDJbUaCUvyAw4Z7kWAFdk0XV7SimsFEjJZ0Tv-sHamNps5_vs3VeD6-vYZiGmrPiO-VuDo0_TA90H2rqp-zHb4MF31-QyYNP5xf-dk-LpsVg_59vXzcv6YZujkTL3wdAAGCqGykoLQjqqVRDCVEIAGmdQO1DacDQYpgSM-YpZw5wSICs-J7fn2pNWeUz1AdNY_umVJ72JuDsTxxQ_B9_15T4OqZ02lcDBmIlcAf8F1lZR5w</recordid><startdate>20210317</startdate><enddate>20210317</enddate><creator>Frederik Meyer Bønneland</creator><creator>Jensen, Peter Gjøl</creator><creator>Larsen, Kim Guldstrand</creator><creator>Muñiz, Marco</creator><creator>Srba, Jiří</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20210317</creationdate><title>Stubborn Set Reduction for Two-Player Reachability Games</title><author>Frederik Meyer Bønneland ; Jensen, Peter Gjøl ; Larsen, Kim Guldstrand ; Muñiz, Marco ; Srba, Jiří</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a955-ef90f2afd1a7b5b245c087f449d442a9c9a8c27893a9afc9a211ed1b91c7425d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Logic in Computer Science</topic><topic>Games</topic><topic>Petri nets</topic><topic>Reduction</topic><toplevel>online_resources</toplevel><creatorcontrib>Frederik Meyer Bønneland</creatorcontrib><creatorcontrib>Jensen, Peter Gjøl</creatorcontrib><creatorcontrib>Larsen, Kim Guldstrand</creatorcontrib><creatorcontrib>Muñiz, Marco</creatorcontrib><creatorcontrib>Srba, Jiří</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Frederik Meyer Bønneland</au><au>Jensen, Peter Gjøl</au><au>Larsen, Kim Guldstrand</au><au>Muñiz, Marco</au><au>Srba, Jiří</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Stubborn Set Reduction for Two-Player Reachability Games</atitle><jtitle>arXiv.org</jtitle><date>2021-03-17</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability objectives. Our stubborn reduction allows us to prune the interleaving behaviour of both players in the game, and we formally prove its correctness on the class of games played on general labelled transition systems. We then instantiate the framework to the class of weighted Petri net games with inhibitor arcs and provide its efficient implementation in the model checker TAPAAL. Finally, we evaluate our stubborn reduction on several case studies and demonstrate its efficiency.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1912.09875</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2021-03
issn 2331-8422
language eng
recordid cdi_arxiv_primary_1912_09875
source arXiv.org; Free E- Journals
subjects Computer Science - Logic in Computer Science
Games
Petri nets
Reduction
title Stubborn Set Reduction for Two-Player Reachability Games
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T22%3A04%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Stubborn%20Set%20Reduction%20for%20Two-Player%20Reachability%20Games&rft.jtitle=arXiv.org&rft.au=Frederik%20Meyer%20B%C3%B8nneland&rft.date=2021-03-17&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1912.09875&rft_dat=%3Cproquest_arxiv%3E2329991262%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2329991262&rft_id=info:pmid/&rfr_iscdi=true