Results 1  10
of
27
Infinite Runs in Weighted Timed Automata with Energy Constraints
"... We study the problems of existence and construction of infinite schedules for finite weighted automata and oneclock weighted timed automata, subject to boundary constraints on the accumulated weight. More specifically, we consider automata equipped with positive and negative weights on transitions ..."
Abstract

Cited by 41 (12 self)
 Add to MetaCart
(Show Context)
We study the problems of existence and construction of infinite schedules for finite weighted automata and oneclock weighted timed automata, subject to boundary constraints on the accumulated weight. More specifically, we consider automata equipped with positive and negative weights on transitions and locations, corresponding to the production and consumption of some resource (e.g. energy). We ask the question whether there exists an infinite path for which the accumulated weight for any finite prefix satisfies certain constraints (e.g. remains between 0 and some given upperbound). We also consider a game version of the above, where certain transitions may be uncontrollable.
Reachabilitytime games on timed automata
 In Proc. of 34th Int. Colloquium on Automata, Languages and Programming (ICALP’07), LNCS 4596
, 2007
"... In a reachabilitytime game, players Min and Max choose moves so that the time to reach a final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler showed decidability of reachabilitytime games on strongly nonZeno timed automata using a value iteration algorithm. T ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
(Show Context)
In a reachabilitytime game, players Min and Max choose moves so that the time to reach a final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler showed decidability of reachabilitytime games on strongly nonZeno timed automata using a value iteration algorithm. This paper complements their work by providing a strategy improvement algorithm for the problem. It also generalizes their decidability result because the proposed strategy improvement algorithm solves reachabilitytime games on all timed automata. The exact computational complexity of solving reachabilitytime games is also established: the problem is EXPTIMEcomplete for timed automata with at least two clocks. 1
Nash equilibria for reachability objectives in multiplayer timed games
 LAB. SPÉCIFICATION & VÉRIFICATION, ENS
, 2010
"... We propose a procedure for computing Nash equilibria in multiplayer timed games with reachability objectives. Our procedure is based on the construction of a finite concurrent game, and on a generic characterization of Nash equilibria in (possibly infinite) concurrent games. Along the way, we use ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
(Show Context)
We propose a procedure for computing Nash equilibria in multiplayer timed games with reachability objectives. Our procedure is based on the construction of a finite concurrent game, and on a generic characterization of Nash equilibria in (possibly infinite) concurrent games. Along the way, we use our characterization to compute Nash equilibria in finite concurrent games.
BPA bisimilarity is EXPTIMEhard
 INFORMATION PROCESSING LETTERS 113 (2013) 101–106
, 2013
"... ..."
(Show Context)
Nash equilibria in concurrent games with Büchi objectives
 In FSTTCS’11, LIPIcs
, 2011
"... We study the problem of computing purestrategy Nash equilibria in multiplayer concurrent games with Büchidefinable objectives. First, when the objectives are Büchi conditions on the game, we prove that the existence problem can be solved in polynomial time. In a second part, we extend our techniqu ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
We study the problem of computing purestrategy Nash equilibria in multiplayer concurrent games with Büchidefinable objectives. First, when the objectives are Büchi conditions on the game, we prove that the existence problem can be solved in polynomial time. In a second part, we extend our technique to objectives defined by deterministic Büchi automata, and prove that the problem then becomes EXPTIMEcomplete. We prove PSPACEcompleteness for the case where the Büchi automata are 1weak.
BISIMILARITY ON BASIC PROCESS ALGEBRA IS IN 2EXPTIME (AN EXPLICIT PROOF)
 VOL. 9(1:10)2013, PP. 1–19
, 2013
"... ..."
DiscreteTime Verification and Control for Probabilistic Rectangular Hybrid Automata
"... Abstract—Hybrid automata provide a modeling formalism for systems characterized by a combination of discrete and continuous components. Probabilistic rectangular automata generalize the class of rectangular hybrid automata with the possibility of representing random behavior of the discrete componen ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Abstract—Hybrid automata provide a modeling formalism for systems characterized by a combination of discrete and continuous components. Probabilistic rectangular automata generalize the class of rectangular hybrid automata with the possibility of representing random behavior of the discrete components of the system. We consider the following two problems regarding probabilistic rectangular automata: verification concerns the computation of the maximum probability with which the system can satisfy a certain ωregular specification; control concerns the computation of a strategy which guides certain choices of the system in order to maximize the probability of satisfying a certain ωregular specification. Our main contribution is to give algorithms for the verification and control problems for probabilistic rectangular automata in a semantics in which discrete control transitions can occur only at integer points in time. Additionally, we give algorithms for verification of ωregular specifications of probabilistic timed automata, a subclass of probabilistic rectangular automata, with the usual densetime semantics. I.
AverageTime Games
 FSTTCS 2008
, 2008
"... ABSTRACT. An averagetime 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 minimize the average time per transition and playe ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
ABSTRACT. An averagetime 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 minimize the average time per transition and player Max wants to maximize it. A solution of averagetime games is presented using a reduction to averageprice game on a finite graph. A direct consequence is an elementary proof of determinacy for averagetime games. This complements our results for reachabilitytime games and partially solves a problem posed by Bouyer et al., to design an algorithm for solving averageprice games on priced timed automata. The paper also establishes the exact computational complexity of solving averagetime games: the problem is EXPTIMEcomplete for timed automata with at least twoclocks.
CONCAVELYPRICED PROBABILISTIC TIMED AUTOMATA
"... Concavelypriced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavelypriced probabilistic timed automata for arbitrary initial states. We prove that these pro ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Concavelypriced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavelypriced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIMEcomplete for probabilistic timed automata with two or more clocks and PTIMEcomplete for automata with one clock. Previous work on expected price problems for probabilistic timed automata was restricted to expected reachability for linearlypriced automata and integer valued initial states. This work uses the boundary region graph introduced by Jurdziński and Trivedi to analyse properties of concavelypriced (nonprobabilistic) timed automata.
Looking at MeanPayoff and TotalPayoff through Windows
, 2013
"... We consider twoplayer games played on weighted directed graphs with meanpayoff and totalpayoff objectives, two classical quantitative objectives. While for singledimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multidimensional meanp ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
We consider twoplayer games played on weighted directed graphs with meanpayoff and totalpayoff objectives, two classical quantitative objectives. While for singledimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multidimensional meanpayoff games that are known to be coNPcomplete, multidimensional totalpayoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving meanpayoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIMEcomplete, and (ii) there is no primitiverecursive algorithm to decide the existence of a bounded window.