Quantitative Compositional Reasoning

Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Ida Antoinette Stoelinga

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    16 Citations (Scopus)
    87 Downloads (Pure)


    We present a compositional theory of system verifica tion, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantitative system properties, such as resource consumption, price or a measure of how well a system satisfies its specification. The theory supports the composition of systems and specifications, and the hiding of variables. Boolean refinement relations are replaced by real-numbered distances between descriptions of a system at different levels of detail. We show that classical boolean rules for compositional reseaning have their quantitive counterparts in our setting. While our theory allows costs to be specified by arbitrary cost functions, we also consider a class of linear cost functions, which give rise to an instance of our framework wher all operations are computable in polynomial time.
    Original languageEnglish
    Title of host publicationThird International Conference on the Quantitative Evaluation of Systems (QEST'06)
    Place of PublicationLos Alamitos, CA
    Number of pages10
    ISBN (Print)0-7695-2665-9
    Publication statusPublished - Sept 2006
    Event3rd International Conference on Quantitative Evaluation of SysTems, QEST 2006 - University of California, Riverside, United States
    Duration: 11 Sept 200614 Sept 2006
    Conference number: 3


    Conference3rd International Conference on Quantitative Evaluation of SysTems, QEST 2006
    Abbreviated titleQEST
    Country/TerritoryUnited States
    Internet address


    Dive into the research topics of 'Quantitative Compositional Reasoning'. Together they form a unique fingerprint.

    Cite this