Fast Mu-calculus Model Checking when Tree-width is Bounded
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F03%3A00009597" target="_blank" >RIV/00216224:14330/03:00009597 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/03:00008708
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Fast Mu-calculus Model Checking when Tree-width is Bounded
Original language description
We show that the model checking problem for mu-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. Since control flow graphs of programs written in high-level languages are usually of bounded tree-width, thisgives us a faster algorithm for software model checking. 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. Modification of this algorithm gives us acompletely new algorithm for mu-calculus model checking. Finally, we discuss some implications and future work.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F03%2F1161" target="_blank" >GA201/03/1161: Verification of infinite-state systems</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
CAV 2003
ISBN
3-540-40524-0
ISSN
—
e-ISSN
—
Number of pages
13
Pages from-to
80-92
Publisher name
Springer-Verlag
Place of publication
Berlin Heidelberg
Event location
Boulder, CO, USA
Event date
Jan 1, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—