The complexity of mean payoff games on graphs
Theoretical Computer Science
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
On the Complexity of Parity Word Automata
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Memoryless determinacy of parity and mean payoff games: a simple proof
Theoretical Computer Science
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Compositional Quantitative Reasoning
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Weighted automata and weighted logics
Theoretical Computer Science
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
On Omega-Languages Defined by Mean-Payoff Conditions
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Verifying quantitative properties using bound functions
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Time for verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Robust discrete synthesis against unspecified disturbances
Proceedings of the 14th international conference on Hybrid systems: computation and control
QUASY: quantitative synthesis tool
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Quantitative synthesis for concurrent programs
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Energy and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
From boolean to quantitative synthesis
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Measuring permissiveness in parity games: mean-payoff parity games revisited
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Theoretical Computer Science
Measuring and synthesizing systems in probabilistic environments
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Robustness in the presence of liveness
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Synthesis of Reactive(1) designs
Journal of Computer and System Sciences
Equilibria in quantitative reachability games
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Games and markov decision processes with mean-payoff parity and energy parity objectives
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Recent challenges and ideas in temporal synthesis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Synthesizing efficient controllers
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Subgame perfection for equilibria in quantitative reachability games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Automated model repair for distributed programs
ACM SIGACT News
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Theoretical Computer Science
Synthesis from incompatible specifications
Proceedings of the tenth ACM international conference on Embedded software
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Polynomial-Time algorithms for energy games with special weight structures
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Generalized reactivity(1) synthesis without a monolithic strategy
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
A temporal logic with mean-payoff constraints
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Synthesis from LTL specifications with mean-payoff objectives
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Formalizing and reasoning about quality
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hyperplane separation technique for multidimensional mean-payoff games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Bridging boolean and quantitative synthesis using smoothed proof search
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
A theory of robust omega-regular software synthesis
ACM Transactions on Embedded Computing Systems (TECS)
Quantitative reactive modeling and verification
Computer Science - Research and Development
On Equilibria in Quantitative Games with Reachability/Safety Objectives
Theory of Computing Systems
A note on the approximation of mean-payoff games
Information Processing Letters
Hi-index | 0.00 |
Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another. For example, if a specification asks that every request is followed by a response, one may prefer an implementation that generates responses quickly but does not generate unnecessary responses. We use quantitative properties to measure the "goodness" of an implementation. Using games with corresponding quantitative objectives, we can synthesize "optimal" implementations, which are preferred among the set of possible implementations that satisfy a given specification. In particular, we show how automata with lexicographic mean-payoff conditions can be used to express many interesting quantitative properties for reactive systems. In this framework, the synthesis of optimal implementations requires the solution of lexicographic mean-payoff games (for safety requirements), and the solution of games with both lexicographic mean-payoff and parity objectives (for liveness requirements). We present algorithms for solving both kinds of novel graph games.