1,721,210 research outputs found
Computational Systems Biology With Constraints. Stochastic modeling of biological systems with concurrent constraint programming.
No full textHybrid behaviour of Markov population models
Full text linkWe investigate the behaviour of population models, specified in stochastic Concurrent Constraint Programming (sCCP). In particular, we focus on models from which we can define a semantics both in terms of Continuous Time Markov Chains (CTMC) and in terms of Stochastic Hybrid Systems, in which some populations are approximated continuously, while others are kept discrete. We will prove the correctness of the hybrid semantics from the point of view of the limiting behaviour of a sequence of models for increasing population size. More specifically, we prove that, under suitable regularity conditions, the sequence of CTMC constructed from sCCP programs for increasing population size converges to the hybrid system constructed by means of the hybrid semantics. We investigate in particular what happens for sCCP models in which some transitions are guarded by boolean predicates or in the presence of instantaneous transitions
A Rough guide to Hybrid Limits of Continuous Time Markov Chains
No full textWe discuss several situations in which sequences of Continuous-Time Markov Chain population models exhibit a limit behaviour in terms of hybrid systems, having a mixed discrete and continuous dynamics
(Hybrid) Automata and (Stochastic) Programs. The hybrid automata lattice of a stochastic program
No full textWe 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
A Criterion for the Stochasticity of Matrices with Specified Order Relations
Full text linkWe tackle the following problem: can one replace a real matrix by a stochastic matrix without altering the order relations between entries? We state a general criterion and a convenient necessary condition. The motivation for this work resides in applications to DNA word design
(Hybrid) automata and (stochastic) programs - The hybrid automata lattice of a stochastic program
No full textWe 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
- …
