On Omega-Languages Defined by Mean-Payoff Conditions
From MaRDI portal
Publication:3617739
DOI10.1007/978-3-642-00596-1_24zbMath1234.68248OpenAlexW2161687198MaRDI QIDQ3617739
Gera Weiss, Aldric Degorre, Oded Maler, Rajeev Alur
Publication date: 31 March 2009
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_24
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (8)
Hyperplane separation technique for multidimensional mean-payoff games ⋮ Temporal Specifications with Accumulative Values ⋮ Recognizable sets of power series over finite fields ⋮ Emptiness and Universality Problems in Timed Automata with Positive Frequency ⋮ Unnamed Item ⋮ The Complexity of Nash Equilibria in Limit-Average Games ⋮ Measuring and Synthesizing Systems in Probabilistic Environments ⋮ The complexity of multi-mean-payoff and multi-energy games
Cites Work
- Unnamed Item
- Unnamed Item
- Reasoning about infinite computations
- The complexity of mean payoff games on graphs
- Concurrent games with tail objectives
- Ranking Automata and Games for Prioritized Requirements
- Quantitative Languages
- The complexity of quantitative concurrent parity games
- Deterministic Priority Mean-Payoff Games as Limits of Discounted Games
- Lattice Automata
This page was built for publication: On Omega-Languages Defined by Mean-Payoff Conditions
