Results 1 
2 of
2
Stochastic transition systems for continuous state spaces and nondeterminism
 In FoSSaCS’05, LNCS 3441
, 2005
"... Abstract. We study the interaction between nondeterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountable branching. Models of such systems have been proposed previously. Here, we introduce a model that extends probabilistic ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
(Show Context)
Abstract. We study the interaction between nondeterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountable branching. Models of such systems have been proposed previously. Here, we introduce a model that extends probabilistic automata to the continuous setting. We identify the class of schedulers that ensures measurability properties on executions, and show that such measurability properties are preserved by parallel composition. Finally, we demonstrate how these results allow us to define an alternative notion of weak bisimulation in our model. 1
Incremental control synthesis in probabilistic environments with temporal logic constraints
 In Proc. of 51st IEEE Conf. on Decision and Control (CDC
, 2012
"... Abstract — In this paper, we present a method for optimal control synthesis of a plant that interacts with a set of agents in a graphlike environment. The control specification is given as a temporal logic statement about some properties that hold at the vertices of the environment. The plant is as ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
Abstract — In this paper, we present a method for optimal control synthesis of a plant that interacts with a set of agents in a graphlike environment. The control specification is given as a temporal logic statement about some properties that hold at the vertices of the environment. The plant is assumed to be deterministic, while the agents are probabilistic Markov models. The goal is to control the plant such that the probability of satisfying a syntactically cosafe Linear Temporal Logic formula is maximized. We propose a computationally efficient incremental approach based on the fact that temporal logic verification is computationally cheaper than synthesis. We present a casestudy where we compare our approach to the classical nonincremental approach in terms of computation time and memory usage. I.