Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Reasoning about infinite computations
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
The complexity of quantitative concurrent parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Concurrent games with tail objectives
Theoretical Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Ranking Automata and Games for Prioritized Requirements
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Deterministic priority mean-payoff games as limits of discounted games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Better Quality in Synthesis through Quantitative Objectives
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
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
Mean-payoff automaton expressions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Church synthesis problem for noisy input
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Emptiness and universality problems in timed automata with positive frequency
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
The complexity of nash equilibria in limit-average games
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Measuring and synthesizing systems in probabilistic environments
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
The complexity of mean-payoff automaton expression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A temporal logic with mean-payoff constraints
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
| Hi-index | 0.00 |
In quantitative verification, system states/transitions have associated payoffs, and these are used to associate mean-payoffs with infinite behaviors. In this paper, we propose to define *** -languages via Boolean queries over mean-payoffs. Requirements concerning averages such as "the number of messages lost is negligible" are not *** -regular, but specifiable in our framework. We show that, for closure under intersection, one needs to consider multi-dimensional payoffs. We argue that the acceptance condition needs to examine the set of accumulation points of sequences of mean-payoffs of prefixes, and give a precise characterization of such sets. We propose the class of multi-threshold mean-payoff languages using acceptance conditions that are Boolean combinations of inequalities comparing the minimal or maximal accumulation point along some coordinate with a constant threshold. For this class of languages, we study expressiveness, closure properties, analyzability, and Borel complexity.