Energy mu-Calculus: Symbolic Fixed-Point Algorithms for omega-Regular Energy Games

05/01/2020 ∙ by Gal Amram, et al. ∙ 0

ω-regular energy games, which are weighted two-player turn-based games with the quantitative objective to keep the energy levels non-negative, have been used in the context of verification and synthesis. The logic of modal μ-calculus, when applied over game graphs with ω-regular winning conditions, allows defining symbolic algorithms in the form of fixed-point formulas for computing the sets of winning states. In this paper, we introduce energy μ-calculus, a multi-valued extension of the μ-calculus that serves as a symbolic framework for solving ω-regular energy games. Energy μ-calculus enables the seamless reuse of existing, well-known symbolic μ-calculus algorithms for ω-regular games, to solve their corresponding energy augmented variants. We define the syntax and semantics of energy μ-calculus over symbolic representations of the game graphs, and show how to use it to solve the decision and the minimum credit problems for ω-regular energy games, for both bounded and unbounded energy level accumulations.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.