Fixpoints vs Moore Families

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

Documents

View graph of relations

Model checking and static analysis are both successful approaches to the analysis of IT systems and it has been shown that many static analyses can be reduced to model checking. Recent results show that CTL model checking can be reduced to static analysis and that the set of satisfying states of a CTL formula can be described as the least element in a Moore family of acceptable sets of states for the static analysis. Turning the attention to the μ-calculus we are able to generalise this result to the alternation-free fragment whereas even for the fragment of alternation depth 2 we show that the fixed point characterisation cannot be recast as a Moore family property.
Original languageEnglish
Title of host publicationProceedings of SOFSEM 2011
Number of pages12
Publication date2012
StatePublished

Conference

Conference38th International Conference on Current Trends in Theory and Practice of Computer Science : Student Research Forum
CountryCzech Republic
CityŠpindlerův Mlýn
Period21/01/1227/01/12
Internet addresshttp://www.sofsem.cz/sofsem12/
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 6262157