Results 1  10
of
183
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
 In: Proceedings of the 6th International Conference on Language and Automata Theory and Applications (LATA’12). Volume 7183 of Lecture Notes in Computer Science., SpringerVerlag
, 2012
"... Abstract. This paper introduces the model of priced timed pushdown systems as an extension of discretetimed pushdown systems with a cost model that assigns multidimensional costs to both transitions and stack symbols. For this model, we consider the minimal cost reachability problem: i.e., given a ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract. This paper introduces the model of priced timed pushdown systems as an extension of discretetimed pushdown systems with a cost model that assigns multidimensional costs to both transitions and stack symbols. For this model, we consider the minimal cost reachability problem: i.e., given
Minimal cost reachability/coverability in priced timed Petri nets
 In FoSSaCS’09, volume 5504 of LNCS
, 2009
"... Abstract. We extend discretetimed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are nonnegative, wh ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
Abstract. We extend discretetimed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
, 1999
"... A Markov decision process is a generalization of a Markov chain in which both probabilistic and nondeterministic choice coexist. Given a Markov decision process with costs associated with the transitions and a set of target states, the stochastic shortest path problem consists in computing the minim ..."
Abstract

Cited by 51 (2 self)
 Add to MetaCart
that the policies that minimize or maximize the expected cost also lead to the target with probability 1. This assumption does not necessarily hold for Markov decision processes that arise as model for distributed probabilistic systems. We present efficient methods for solving these two classes of problems without
Reachability in Weighted Probabilistic Timed Automata
, 2005
"... This thesis introduces the model of Weighted Probabilistic Timed Automata (WPTA). WPTA are an extension of the well known Timed Automata. With WPTA we can make a specification of systems that have discrete control, and continuous realtime behaviour. Moreover we can model costpertime, depending on ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
on the discrete state, and we can model probability on the discrete behaviour. An example of a system that can be modeled as WPTA is a taskscheduling problem with costpertime on resources, and resources being available with a certain probability. The question is whether model checking, i. e. the automatic
Revisiting Decidability and Optimum Reachability for MultiPriced Timed Automata
, 2009
"... We investigate the optimum reachability problem for MultiPriced Timed Automata (MPTA) that admit both positive and negative costs on edges and locations, thus bridging the gap between the results of Bouyer et al. (2007) and of Larsen and Rasmussen (2008). Our contributions are the following: (1) We ..."
Abstract
 Add to MetaCart
We investigate the optimum reachability problem for MultiPriced Timed Automata (MPTA) that admit both positive and negative costs on edges and locations, thus bridging the gap between the results of Bouyer et al. (2007) and of Larsen and Rasmussen (2008). Our contributions are the following: (1
Minimizing electricity cost: Optimization of distributed internet data centers in a multielectricitymarket environment
 In Proc. of INFOCOM
, 2010
"... Abstract—The study of CyberPhysical System (CPS) has been an active area of research. Internet Data Center (IDC) is an important emerging CyberPhysical System. As the demand on Internet services drastically increases in recent years, the power used by IDCs has been skyrocketing. While most existin ..."
Abstract

Cited by 98 (9 self)
 Add to MetaCart
existing research focuses on reducing power consumptions of IDCs, the power management problem for minimizing the total electricity cost has been overlooked. This is an important problem faced by service providers, especially in the current multielectricity market, where the price of electricity may
MINIMAL TIME PROBLEMS WITH MOVING TARGETS AND OBSTACLES
, 2011
"... Abstract. We consider minimal time problems governed by nonlinear systems under general time dependent state constraints and in the twoplayer games setting. In general, it is known that the characterization of the minimal time function, as well as the study of its regularity properties, is a difficu ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
supremum cost function but is free of state constraints. This auxiliary control problem allows to characterize easily the backward reachable sets, and then, the minimal time function, without assuming any controllability assumption. These techniques are linked to the well known levelset approaches
Blackbox conformance testing for realtime systems
 In 11th International SPIN Workshop on Model Checking of Software (SPIN’04), volume 2989 of LNCS
, 2004
"... We propose a new framework for blackbox conformance testing of realtime systems. The framework is based on the model of partiallyobservable, nondeterministic timed automata. We argue that partial observability and nondeterminism are essential features for ease of modeling, expressiveness and im ..."
Abstract

Cited by 76 (11 self)
 Add to MetaCart
analogclock tests is based on an onthefly determinization of the specification automaton during the execution of the test, which in turn relies on reachability computations. The latter can sometimes be costly, thus problematic, since the tester must quickly react to the actions of the system under test
TimeDependent Broadband Pricing: Feasibility and Benefits
"... Abstract—Charging different prices for Internet access at different times induces users to spread out their bandwidth consumption across times of the day. The questions are: is it feasible and how much benefit can it bring? We develop an efficient way to compute the costminimizing timedependent pr ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
Abstract—Charging different prices for Internet access at different times induces users to spread out their bandwidth consumption across times of the day. The questions are: is it feasible and how much benefit can it bring? We develop an efficient way to compute the costminimizing time
Dayahead bidding strategies for demandside expected cost minimization
 In Preparation
, 2012
"... Abstract—Dayahead DSM techniques in the smart grid allow the supplyside to know in advance an estimation of the amount of energy to be provided to the demandside during the upcoming day. However, a pure dayahead optimization process cannot accommodate potential realtime deviations from the expe ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
penalty system that limits the realtime fluctuations around the bid energy loads. In this dayahead bidding process, demandside users, possibly having energy production and storage capabilities, are interested in minimizing their expected monetary expense. The resulting optimization problem
Results 1  10
of
183