(Hybrid) automata and (stochastic) programs: The hybrid automata lattice of a stochastic program


We define a semantics for stochastic Concurrent Constraint Programming (sCCP), a stochastic process algebra, in terms of stochastic hybrid automata with piecewise deterministic continuous dynamics. To each program we associate a lattice of hybrid models, parameterized with respect to the degree of discreteness left. We study some properties of this lattice, presenting also an alternative semantics in which the degree of discreteness can be dynamically changed. © The Author, 2011. Published by Oxford University Press. All rights reserved.

Journal of Logic and Computation