Improving Parity Game Solvers with Justifications

Improving Parity Game Solvers with Justifications

Parity games are infinite two-player games played on node-weighted directed graphs. Formal verification problems such as verifying and synthesizing automata, bounded model checking of LTL, CTL*, propositional µ-calculus, ...reduce to problems over parity games. The core problem of parity game solvin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lapauw, Ruben, Bruynooghe, Maurice, Denecker, Marc
Format: Tagungsbericht
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 470
container_issue
container_start_page 449
container_title
container_volume 11990
creator Lapauw, Ruben
Bruynooghe, Maurice
Denecker, Marc
description Parity games are infinite two-player games played on node-weighted directed graphs. Formal verification problems such as verifying and synthesizing automata, bounded model checking of LTL, CTL*, propositional µ-calculus, ...reduce to problems over parity games. The core problem of parity game solving is deciding the winner of some (or all) nodes in a parity game. In this paper, we improve several parity game solvers by using a justification graph. Experimental evaluation shows our algorithms improve upon the state-of-the-art.
format Conference Proceeding
fullrecord <record><control><sourceid>kuleuven</sourceid><recordid>TN_cdi_kuleuven_dspace_123456789_646997</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>123456789_646997</sourcerecordid><originalsourceid>FETCH-kuleuven_dspace_123456789_6469973</originalsourceid><addsrcrecordid>eNqVirsKwjAUQAMqWLX_kM1BCmlSm95ZfE6C7iHUVKN90ZtW_Xs7-AHKGc4ZzoD4IBPBekDwkA-J1zcPQEZiTCaId8YYl8A9Eu6Luqk6W17pUTfWvelWF4aeqrwzDdKndTd6aNHZzKba2arEGRllOkfjfz0l8836vNoFjzY3bWdKdcFap0aFXETLWCag4igGkOKfc_HbqdzLiQ_bK0Sm</addsrcrecordid><sourcetype>Institutional Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Improving Parity Game Solvers with Justifications</title><source>Lirias (KU Leuven Association)</source><source>Springer Books</source><creator>Lapauw, Ruben ; Bruynooghe, Maurice ; Denecker, Marc</creator><contributor>Zufferey, Damien ; Beyer, Dirk</contributor><creatorcontrib>Lapauw, Ruben ; Bruynooghe, Maurice ; Denecker, Marc ; Zufferey, Damien ; Beyer, Dirk</creatorcontrib><description>Parity games are infinite two-player games played on node-weighted directed graphs. Formal verification problems such as verifying and synthesizing automata, bounded model checking of LTL, CTL*, propositional µ-calculus, ...reduce to problems over parity games. The core problem of parity game solving is deciding the winner of some (or all) nodes in a parity game. In this paper, we improve several parity game solvers by using a justification graph. Experimental evaluation shows our algorithms improve upon the state-of-the-art.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783030393212</identifier><identifier>ISBN: 3030393216</identifier><language>eng</language><publisher>Springer Nature Switzerland AG</publisher><ispartof>Proceedings of VMCAI 2020, 2020, Vol.11990, p.449-470</ispartof><lds50>peer_reviewed</lds50><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>309,310,315,776,780,785,786,27837</link.rule.ids></links><search><contributor>Zufferey, Damien</contributor><contributor>Beyer, Dirk</contributor><creatorcontrib>Lapauw, Ruben</creatorcontrib><creatorcontrib>Bruynooghe, Maurice</creatorcontrib><creatorcontrib>Denecker, Marc</creatorcontrib><title>Improving Parity Game Solvers with Justifications</title><title>Proceedings of VMCAI 2020</title><description>Parity games are infinite two-player games played on node-weighted directed graphs. Formal verification problems such as verifying and synthesizing automata, bounded model checking of LTL, CTL*, propositional µ-calculus, ...reduce to problems over parity games. The core problem of parity game solving is deciding the winner of some (or all) nodes in a parity game. In this paper, we improve several parity game solvers by using a justification graph. Experimental evaluation shows our algorithms improve upon the state-of-the-art.</description><issn>0302-9743</issn><isbn>9783030393212</isbn><isbn>3030393216</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2020</creationdate><recordtype>conference_proceeding</recordtype><sourceid>FZOIL</sourceid><recordid>eNqVirsKwjAUQAMqWLX_kM1BCmlSm95ZfE6C7iHUVKN90ZtW_Xs7-AHKGc4ZzoD4IBPBekDwkA-J1zcPQEZiTCaId8YYl8A9Eu6Luqk6W17pUTfWvelWF4aeqrwzDdKndTd6aNHZzKba2arEGRllOkfjfz0l8836vNoFjzY3bWdKdcFap0aFXETLWCag4igGkOKfc_HbqdzLiQ_bK0Sm</recordid><startdate>20200121</startdate><enddate>20200121</enddate><creator>Lapauw, Ruben</creator><creator>Bruynooghe, Maurice</creator><creator>Denecker, Marc</creator><general>Springer Nature Switzerland AG</general><scope>FZOIL</scope></search><sort><creationdate>20200121</creationdate><title>Improving Parity Game Solvers with Justifications</title><author>Lapauw, Ruben ; Bruynooghe, Maurice ; Denecker, Marc</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-kuleuven_dspace_123456789_6469973</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2020</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lapauw, Ruben</creatorcontrib><creatorcontrib>Bruynooghe, Maurice</creatorcontrib><creatorcontrib>Denecker, Marc</creatorcontrib><collection>Lirias (KU Leuven Association)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lapauw, Ruben</au><au>Bruynooghe, Maurice</au><au>Denecker, Marc</au><au>Zufferey, Damien</au><au>Beyer, Dirk</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Improving Parity Game Solvers with Justifications</atitle><btitle>Proceedings of VMCAI 2020</btitle><date>2020-01-21</date><risdate>2020</risdate><volume>11990</volume><spage>449</spage><epage>470</epage><pages>449-470</pages><issn>0302-9743</issn><isbn>9783030393212</isbn><isbn>3030393216</isbn><abstract>Parity games are infinite two-player games played on node-weighted directed graphs. Formal verification problems such as verifying and synthesizing automata, bounded model checking of LTL, CTL*, propositional µ-calculus, ...reduce to problems over parity games. The core problem of parity game solving is deciding the winner of some (or all) nodes in a parity game. In this paper, we improve several parity game solvers by using a justification graph. Experimental evaluation shows our algorithms improve upon the state-of-the-art.</abstract><pub>Springer Nature Switzerland AG</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Proceedings of VMCAI 2020, 2020, Vol.11990, p.449-470
issn 0302-9743
language eng
recordid cdi_kuleuven_dspace_123456789_646997
source Lirias (KU Leuven Association); Springer Books
title Improving Parity Game Solvers with Justifications
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T17%3A04%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-kuleuven&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Improving%20Parity%20Game%20Solvers%20with%20Justifications&rft.btitle=Proceedings%20of%20VMCAI%202020&rft.au=Lapauw,%20Ruben&rft.date=2020-01-21&rft.volume=11990&rft.spage=449&rft.epage=470&rft.pages=449-470&rft.issn=0302-9743&rft.isbn=9783030393212&rft.isbn_list=3030393216&rft_id=info:doi/&rft_dat=%3Ckuleuven%3E123456789_646997%3C/kuleuven%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true