The complexity of mean payoff games on graphs
Theoretical Computer Science
Theoretical Computer Science
Software Metrics: A Rigorous and Practical Approach
Software Metrics: A Rigorous and Practical Approach
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Toward an Approximation Theory for Computerised Control
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Weighted automata and weighted logics
Theoretical Computer Science
Comparing software metrics tools
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Linear and Branching System Metrics
IEEE Transactions on Software Engineering
Better Quality in Synthesis through Quantitative Objectives
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Expressiveness and Closure Properties for Quantitative Languages
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
The use of triple-modular redundancy to improve computer reliability
IBM Journal of Research and Development
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Weighted modal transition systems
Formal Methods in System Design
From model checking to model measuring
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Cost preserving bisimulations for probabilistic automata
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 5.23 |
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of ''fit'' or ''desirability''. We extend the simulation preorder to the quantitative setting by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.