Quantitative Model Checking Revisited: Neither Decidable Nor Approximable

TitleQuantitative Model Checking Revisited: Neither Decidable Nor Approximable
Publication TypeConference Paper
Year of Publication2007
AuthorsGiro, S, D'Argenio, PR
Conference NameFormal Modeling and Analysis of Timed Systems, 5th International Conference, FORMATS 2007
PublisherSpringer
ISBN Number978-3-540-75453-4
AbstractQuantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilities calculated in such a way are overestimations on models of distributed systems in which components are loosely coupled and share little information with each other (and hence arbitrary schedulers may result too powerful). Therefore, we focus on the quantitative model checking problem restricted to distributed schedulers that are obtained only as a combination of local schedulers (i.e. the schedulers of each component) and show that this problem is undecidable. In fact, we show that there is no algorithm that can compute an approximation to the maximum probability of reaching a state within a given bound when restricted to distributed schedulers.
DOI10.1007/978-3-540-75454-1_14
PDF (Full text): 
Powered by Drupal