Departmental Papers (CIS)

Date of this Version

3-2009

Document Type

Conference Paper

Comments

From the 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009.

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 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.

Subject Area

CPS Theory

Publication Title

Lecture Notes in Computer Science: Foundations of Software Science and Computational Structures

Volume

5504

First Page

333

Last Page

347

DOI

10.1007/978-3-642-00596-1_24

Permission Statement

The original publication is available at www.springerlink.com

Share

COinS
 

Date Posted: 17 July 2012