From model checking to model measuring
LNCS
Henzinger, Thomas A
Otop, Jan
ddc:005
ddc:000
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.
Springer
2013
info:eu-repo/semantics/conferenceObject
doc-type:conferenceObject
text
https://research-explorer.app.ist.ac.at/record/2327
https://research-explorer.app.ist.ac.at/download/2327/5301
Henzinger TA, Otop J. From model checking to model measuring. 2013;8052:273-287. doi:<a href="https://doi.org/10.1007/978-3-642-40184-8_20">10.1007/978-3-642-40184-8_20</a>
eng
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-40184-8_20
info:eu-repo/semantics/closedAccess