Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for μ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first showing a related result: the winner in a parity game on a graph of bounded tree-width can be decided in polynomial time. Th...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 92 |
---|---|
container_issue | |
container_start_page | 80 |
container_title | |
container_volume | |
creator | OBDRZALEK, Jan |
description | We show that the model checking problem for μ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first showing a related result: the winner in a parity game on a graph of bounded tree-width can be decided in polynomial time. The given algorithm is then modified to obtain a new algorithm for μ-calculus model checking. One possible use of this algorithm may be software verification, since control flow graphs of programs written in high-level languages are usually of bounded tree-width. Finally, we discuss some implications and future work. |
doi_str_mv | 10.1007/978-3-540-45069-6_7 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_15618560</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>15618560</sourcerecordid><originalsourceid>FETCH-LOGICAL-p227t-f9f50c7092e15a7988909e4adc3bd6e7eeb12257ba61d9323ae55b9df67a21f93</originalsourceid><addsrcrecordid>eNotkM1OwzAQhM2fRCl9Ai65cDSs7diOuUFEoVIrLkUcLSfetKEhqeJGFW-PabuX0c6M5vARcsfggQHoR6MzKqhMgaYSlKHK6jNyI6Jx-NU5GTHFGBUiNRenACRP4ZKMQACnRqfimkxC-IZ4gnPQckSepi7sksVAc9eUQzOEZNF5bJJ8jeWmblfJfo1tsuwR6Vftd-tkFpKXbmg9-ltyVbkm4OSkY_I5fV3m73T-8TbLn-d0y7ne0cpUEkoNhiOTTpssM2Awdb4UhVeoEQvGudSFU8wbwYVDKQvjK6UdZ5URY3J_3N26ULqm6l1b1sFu-_rH9b-WScUyqSD22LEXYtSusLdF122CZWD_CdpI0AobudgDMRsJij8hf11A</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Fast Mu-Calculus Model Checking when Tree-Width Is Bounded</title><source>Springer Books</source><creator>OBDRZALEK, Jan</creator><contributor>Hunt, Warren A. ; Somenzi, Fabio</contributor><creatorcontrib>OBDRZALEK, Jan ; Hunt, Warren A. ; Somenzi, Fabio</creatorcontrib><description>We show that the model checking problem for μ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first showing a related result: the winner in a parity game on a graph of bounded tree-width can be decided in polynomial time. The given algorithm is then modified to obtain a new algorithm for μ-calculus model checking. One possible use of this algorithm may be software verification, since control flow graphs of programs written in high-level languages are usually of bounded tree-width. Finally, we discuss some implications and future work.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540405240</identifier><identifier>ISBN: 9783540405245</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540450696</identifier><identifier>EISBN: 9783540450696</identifier><identifier>DOI: 10.1007/978-3-540-45069-6_7</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Model Check ; Outgoing Edge ; Software ; Software engineering ; Start Node ; Tree Decomposition ; Winning Strategy</subject><ispartof>Computer Aided Verification, 2003, p.80-92</ispartof><rights>Springer-Verlag Berlin Heidelberg 2003</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-45069-6_7$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-45069-6_7$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15618560$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Hunt, Warren A.</contributor><contributor>Somenzi, Fabio</contributor><creatorcontrib>OBDRZALEK, Jan</creatorcontrib><title>Fast Mu-Calculus Model Checking when Tree-Width Is Bounded</title><title>Computer Aided Verification</title><description>We show that the model checking problem for μ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first showing a related result: the winner in a parity game on a graph of bounded tree-width can be decided in polynomial time. The given algorithm is then modified to obtain a new algorithm for μ-calculus model checking. One possible use of this algorithm may be software verification, since control flow graphs of programs written in high-level languages are usually of bounded tree-width. Finally, we discuss some implications and future work.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Model Check</subject><subject>Outgoing Edge</subject><subject>Software</subject><subject>Software engineering</subject><subject>Start Node</subject><subject>Tree Decomposition</subject><subject>Winning Strategy</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540405240</isbn><isbn>9783540405245</isbn><isbn>3540450696</isbn><isbn>9783540450696</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkM1OwzAQhM2fRCl9Ai65cDSs7diOuUFEoVIrLkUcLSfetKEhqeJGFW-PabuX0c6M5vARcsfggQHoR6MzKqhMgaYSlKHK6jNyI6Jx-NU5GTHFGBUiNRenACRP4ZKMQACnRqfimkxC-IZ4gnPQckSepi7sksVAc9eUQzOEZNF5bJJ8jeWmblfJfo1tsuwR6Vftd-tkFpKXbmg9-ltyVbkm4OSkY_I5fV3m73T-8TbLn-d0y7ne0cpUEkoNhiOTTpssM2Awdb4UhVeoEQvGudSFU8wbwYVDKQvjK6UdZ5URY3J_3N26ULqm6l1b1sFu-_rH9b-WScUyqSD22LEXYtSusLdF122CZWD_CdpI0AobudgDMRsJij8hf11A</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>OBDRZALEK, Jan</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2003</creationdate><title>Fast Mu-Calculus Model Checking when Tree-Width Is Bounded</title><author>OBDRZALEK, Jan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p227t-f9f50c7092e15a7988909e4adc3bd6e7eeb12257ba61d9323ae55b9df67a21f93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Model Check</topic><topic>Outgoing Edge</topic><topic>Software</topic><topic>Software engineering</topic><topic>Start Node</topic><topic>Tree Decomposition</topic><topic>Winning Strategy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>OBDRZALEK, Jan</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>OBDRZALEK, Jan</au><au>Hunt, Warren A.</au><au>Somenzi, Fabio</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Fast Mu-Calculus Model Checking when Tree-Width Is Bounded</atitle><btitle>Computer Aided Verification</btitle><date>2003</date><risdate>2003</risdate><spage>80</spage><epage>92</epage><pages>80-92</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540405240</isbn><isbn>9783540405245</isbn><eisbn>3540450696</eisbn><eisbn>9783540450696</eisbn><abstract>We show that the model checking problem for μ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first showing a related result: the winner in a parity game on a graph of bounded tree-width can be decided in polynomial time. The given algorithm is then modified to obtain a new algorithm for μ-calculus model checking. One possible use of this algorithm may be software verification, since control flow graphs of programs written in high-level languages are usually of bounded tree-width. Finally, we discuss some implications and future work.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-45069-6_7</doi><tpages>13</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Computer Aided Verification, 2003, p.80-92 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_15618560 |
source | Springer Books |
subjects | Applied sciences Computer science control theory systems Exact sciences and technology Model Check Outgoing Edge Software Software engineering Start Node Tree Decomposition Winning Strategy |
title | Fast Mu-Calculus Model Checking when Tree-Width Is Bounded |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T00%3A55%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Fast%20Mu-Calculus%20Model%20Checking%20when%20Tree-Width%20Is%20Bounded&rft.btitle=Computer%20Aided%20Verification&rft.au=OBDRZALEK,%20Jan&rft.date=2003&rft.spage=80&rft.epage=92&rft.pages=80-92&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540405240&rft.isbn_list=9783540405245&rft_id=info:doi/10.1007/978-3-540-45069-6_7&rft_dat=%3Cpascalfrancis_sprin%3E15618560%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540450696&rft.eisbn_list=9783540450696&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |