Perspectives in probabilistic verification

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    11 Citations (Scopus)
    153 Downloads (Pure)

    Abstract

    Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabilities. The initial focus was on qualitative properties — e.g., does a program terminate with probability one? — but later efficient algorithms were developed for quantitative questions as well. Model checking of probabilistic models received quite some attention in the late nineties, and this popularity lasts until today. Some application areas are security, randomised distributed algorithms, systems biology, and classical performance analysis. What is the current state of this field? Probabilistic verification, quo vadis? This talks surveys the main achievements during the last years, reports on some recent advances, and attempts to point out some research challenges for the coming years.
    Original languageUndefined
    Title of host publicationProceedings 2nd IEEE/IFIP International Symposium on Theoretical Aspects of Software Engineering
    Place of PublicationLos Alamitos
    PublisherIEEE Computer Society
    Pages3-10
    Number of pages8
    ISBN (Print)978-0-7695-3249-3
    DOIs
    Publication statusPublished - Jun 2008
    Event2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2008 - Nanjing, China
    Duration: 17 Jun 200819 Jun 2008
    Conference number: 2

    Publication series

    Name
    PublisherIEEE Computer Society Press
    Number302

    Conference

    Conference2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2008
    Abbreviated titleTASE
    Country/TerritoryChina
    CityNanjing
    Period17/06/0819/06/08

    Keywords

    • IR-64841
    • METIS-251041
    • EWI-12964

    Cite this