15 research outputs found
Optimal Reachability in Divergent Weighted Timed Games
Weighted timed games are played by two players on a timed automaton equipped
with weights: one player wants to minimise the accumulated weight while
reaching a target, while the other has an opposite objective. Used in a
reactive synthesis perspective, this quantitative extension of timed games
allows one to measure the quality of controllers. Weighted timed games are
notoriously difficult and quickly undecidable, even when restricted to
non-negative weights. Decidability results exist for subclasses of one-clock
games, and for a subclass with non-negative weights defined by a semantical
restriction on the weights of cycles. In this work, we introduce the class of
divergent weighted timed games as a generalisation of this semantical
restriction to arbitrary weights. We show how to compute their optimal value,
yielding the first decidable class of weighted timed games with negative
weights and an arbitrary number of clocks. In addition, we prove that
divergence can be decided in polynomial space. Last, we prove that for untimed
games, this restriction yields a class of games for which the value can be
computed in polynomial time
*-Continuous Kleene -Algebras for Energy Problems
Energy problems are important in the formal analysis of embedded or
autonomous systems. Using recent results on star-continuous Kleene
omega-algebras, we show here that energy problems can be solved by algebraic
manipulations on the transition matrix of energy automata. To this end, we
prove general results about certain classes of finitely additive functions on
complete lattices which should be of a more general interest.Comment: In Proceedings FICS 2015, arXiv:1509.0282
Mean-Payoff Games on Timed Automata
Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players - Player Min and Player Max - by moving a token along the states of the graph to form an infinite run. The goal of Player Min is to minimize the limit average weight of the run, while the goal of the Player Max is the opposite. Brenguier, Cassez, and Raskin recently studied a variation of these games and showed that mean-payoff games are undecidable for timed automata with five or more clocks. We refine this result by proving the undecidability of mean-payoff games with three clocks. On a positive side, we show the decidability of mean-payoff games on one-clock timed automata with binary price-rates. A key contribution of this paper is the application of dynamic programming based proof techniques applied in the context of average reward optimization on an uncountable state and action space
LIPIcs
Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load. Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks. The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting
LIPIcs
Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load. Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks. The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting
An algebraic approach to energy problems I - continuous Kleene ω-algebras ‡
Energy problems are important in the formal analysis of embedded or autonomous systems. With the purpose of unifying a number of approaches to energy problems found in the literature, we introduce energy automata. These are finite automata whose edges are labeled with energy functions that define how energy levels evolve during transitions. Motivated by this application and in order to compute with energy functions, we introduce a new algebraic structure of *-continuous Kleene ω-algebras. These involve a *-continuous Kleene algebra with a *-continuous action on a semimodule and an infinite product operation that is also *-continuous. We define both a finitary and a non-finitary version of *-continuous Kleene ω-algebras. We then establish some of their properties, including a characterization of the free finitary *-continuous Kleene ω-algebras. We also show that every *-continuous Kleene ω-algebra gives rise to an iteration semiring-semimodule pair
Symbolic Approximation of Weighted Timed Games
Weighted timed games are zero-sum games played by two players on a timed
automaton equipped with weights, where one player wants to minimise the
accumulated weight while reaching a target. Weighted timed games are
notoriously difficult and quickly undecidable, even when restricted to
non-negative weights. For non-negative weights, the largest class that can be
analysed has been introduced by Bouyer, Jaziri and Markey in 2015. Though the
value problem is undecidable, the authors show how to approximate the value by
considering regions with a refined granularity. In this work, we extend this
class to incorporate negative weights, allowing one to model energy for
instance, and prove that the value can still be approximated, with the same
complexity. In addition, we show that a symbolic algorithm, relying on the
paradigm of value iteration, can be used as an approximation schema on this
class
An algebraic approach to energy problems II - the algebra of energy functions
Energy and resource management problems are important in areas such as embedded systems or autonomous systems. They are concerned with the question whether a given system admits infinite schedules during which certain tasks can be repeatedly accomplished and the system never runs out of energy (or other resources). In order to develop a general theory of energy problems, we introduce energy automata: finite automata whose transitions are labeled with energy functions which specify how energy values change from one system state to another. We show that energy functions form a *-continuous Kleene ω-algebra, as an application of a general result that finitely additive, locally *-closed and T-continuous functions on complete lattices form *-continuous Kleene ω-algebras. This permits to solve energy problems in energy automata in a generic, algebraic way. In order to put our work in context, we also review extensions of energy problems to higher dimensions and to games