Average-Time Games on Timed Automata

Computer Science – Computer Science and Game Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by taking turns to perform a timed transition. Player Min wants to minimise the average time per transition and player Max wants to maximise it. A solution of average-time games is presented using a reduction to average-price game on a finite graph. A direct consequence is an elementary proof of determinacy for average-time games. This complements our results for reachability-time games and partially solves a problem posed by Bouyer et al., to design an algorithm for solving average-price games on priced timed automata. The paper also establishes the exact computational complexity of solving average-time games: the problem is EXPTIME-complete for timed automata with at least two clocks.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Average-Time Games on Timed Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Average-Time Games on Timed Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average-Time Games on Timed Automata will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-620357

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.