Limitedness theorem on finite automata with distance functions: an algebraic proof
Theoretical Computer Science
The complexity of mean payoff games on graphs
Theoretical Computer Science
Competitive Markov decision processes
Competitive Markov decision processes
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
Coverage Metrics for Temporal Logic Model Checking
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Model Checking and Modular Verification
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Formal Methods for Analyzing the Completeness of an Assertion Suite against a High-Level Fault Model
VLSID '05 Proceedings of the 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
On the security of public key protocols
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
A theory of mutations with applications to vacuity, coverage, and fault tolerance
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
From Boolean to quantitative notions of correctness
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Automata-Based Axiom Pinpointing
Journal of Automated Reasoning
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Temporal Specifications with Accumulative Values
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Theoretical Computer Science
Measuring and synthesizing systems in probabilistic environments
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Hi-index | 0.00 |
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.