Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On Omega-Languages Defined by Mean-Payoff Conditions
 

Summary: On Omega-Languages Defined
by Mean-Payoff Conditions
Rajeev Alur1
, Aldric Degorre2
, Oded Maler2
, Gera Weiss1
1
Dept. of Computer and Information Science, University of Pennsylvania, USA
{alur, gera}@cis.upenn.edu
2
CNRS - Verimag, University of Grenoble, France
{aldric.degorre, oded.maler}@imag.fr
Abstract. 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 characteriza-

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

 

Collections: Computer Technologies and Information Sciences