DMCA
Compositional quantitative reasoning (2006)
Cached
Download Links
| Venue: | In Proc. QEST’06 |
| Citations: | 13 - 3 self |
BibTeX
@INPROCEEDINGS{Chatterjee06compositionalquantitative,
author = {Krishnendu Chatterjee and Luca De Alfaro and Marco Faella and Thomas A. Henzinger and Rupak Majumdar},
title = {Compositional quantitative reasoning},
booktitle = {In Proc. QEST’06},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. We present a compositional theory of system verica-tion, where specications assign real-numbered costs to systems. These costs can express a wide variety of quantitative system prop-erties, such as resource consumption, price, or a measure of how well a system satises its specication. The theory supports the composition of systems and specications, and the hiding of vari-ables. Boolean renement relations are replaced by real-numbered distances between descriptions of a system at different levels of detail. We show that the classical boolean rules for compositional reasoning have quantitative counterparts in our setting. While our general theory allows costs to be specied by arbi-trary cost functions, we also consider a class of linear cost func-tions, which give rise to an instance of our framework where all operations are computable in polynomial time. 1.
Keyphrases
general theory real-numbered cost compositional reasoning quantitative system prop-erties arbi-trary cost function classical boolean rule polynomial time resource consumption wide variety system verica-tion compositional theory different level real-numbered distance quantitative counterpart linear cost func-tions boolean renement relation
