Results 1 
3 of
3
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.
Gamebased abstraction and controller synthesis for probabilistic hybrid systems
 SFB/TR 14 AVACS, AVACS
, 2011
"... Abstract—We consider a class of hybrid systems that involve random phenomena, in addition to discrete and continuous behaviour. Examples of such systems include wireless sensing and control applications. We propose and compare two abstraction techniques for this class of models, which yield lower a ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
Abstract—We consider a class of hybrid systems that involve random phenomena, in addition to discrete and continuous behaviour. Examples of such systems include wireless sensing and control applications. We propose and compare two abstraction techniques for this class of models, which yield lower and upper bounds on the optimal probability of reaching a particular class of states. We also demonstrate the applicability of these abstraction techniques to the computation of longrun average reward properties and the synthesis of controllers. The first of the two abstractions yields more precise information, while the second is easier to construct. For the latter, we demonstrate how existing solvers for hybrid systems can be leveraged to perform the computation. I.
Relating Average and Discounted Costs for Quantitative Analysis of Timed Systems
"... Quantitative analysis and controller synthesis problems for reactive realtime systems can be formalized as optimization problems on timed automata, timed games, and their probabilistic extensions. The limiting average cost and the discounted cost are two standard criteria for such optimization prob ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Quantitative analysis and controller synthesis problems for reactive realtime systems can be formalized as optimization problems on timed automata, timed games, and their probabilistic extensions. The limiting average cost and the discounted cost are two standard criteria for such optimization problems. In theory of finitestate probabilistic systems, a number of interesting results are available relating the optimal values according to these two different performance objectives. These results, however, do not directly apply to timed systems due to the infinite statespace of clock valuations. In this paper, we present some conditions under which the existence of the limit of optimal discounted cost objective implies the the existence of limiting average cost to the same value. Using these results we answer an open question posed by Fahrenberg and Larsen, and give simpler proofs of some known decidability results on (probabilistic) timed automata. We also show the determinacy and decidability of averagetime games on timed automata, and expected averagetime games on probabilistic timed automata.