Henzinger, Thomas A and Otop, Jan
(2013)
*From Model Checking to Model Measuring.*
In:
CONCUR 2013 – Concurrency Theory.
Lecture Notes in Computer Science, 8052
(8052).
Springer, Berlin Heidelberg, pp. 273-287.
ISBN 978-3-642-40184-8

Text
concur.pdf - Accepted Version Available under License All rights reserved. [IST-2013-129-v1+1] Download (369Kb) |

## Abstract

We define the model-measuring problem: given a model M and specification ϕ, what is the maximal distance ρ such that all models M′ within distance ρ from M satisfy (or violate) ϕ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification. We show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved. We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications.

Item Type: | Book Section |
---|---|

DOI: | 10.1007/978-3-642-40184-8_20 |

Subjects: | 000 Computer science, knowledge & general works > 000 Computer science, knowledge & systems 000 Computer science, knowledge & general works > 000 Computer science, knowledge & systems > 004 Data processing & computer science |

Research Group: | Henzinger Group |

Depositing User: | Jan Otop |

Date Deposited: | 08 Jul 2013 08:33 |

Last Modified: | 26 Apr 2017 12:32 |

URI: | https://repository.ist.ac.at/id/eprint/129 |

### Actions (login required)

View Item |