Compositional Modelling of Stochastic Hybrid Systems

Strubbe, Stefan

doi:10.1201/9781420008548.ch3

Cited by 11 publications

(13 citation statements)

References 58 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, they are related to communicating PDMP [39]. The main differences are in the way continuous dynamics is defined and in the restriction of TDSHA on deterministic resets (which can be, however, easily removed).…”

Section: Remark 34mentioning

confidence: 99%

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

Bortolussi¹,

Policriti²

2011

Journal of Logic and Computation

View full text Add to dashboard Cite

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.

show abstract

Section: Remark 34mentioning

confidence: 99%

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

Bortolussi¹,

Policriti²

2011

Journal of Logic and Computation

View full text Add to dashboard Cite

show abstract

“…A complete and formal semantics for CPDP can be found in [7]. We assume that a CPDP X = (L,V, ν,W, ω, F, G, Σ, A , P, S ) starts at initial hybrid state (l, x), with l ∈ L and x ∈ val(l).…”

Section: Cpdpsmentioning

confidence: 99%

“…The main aim of this paper is to illustrate the use of value passing. For technical results concerning value passing CPDPs, we refer to [7].…”

Section: Introductionmentioning

confidence: 99%

Value passing for communicating piecewise deterministic Markov processes

Strubbe

Schaft²,

Julius

2006

2006 American Control Conference

View full text Add to dashboard Cite

show abstract

“…Because of the lack of space, we refer to [15] for a more extensive description of the decidability conditions. Here we only summarize the results.…”

Section: A Decidability Conditionsmentioning

confidence: 99%

Algorithmic bisimulation for Communicating Piecewise Deterministic Markov Processes

Strubbe

Schaft

Proceedings of the 44th IEEE Conference on Decision and Control

View full text Add to dashboard Cite

Abstract-In this paper we present an algorithm for finding a bisimulation relation for stochastic hybrid systems from the class of CPDPs (Communicating Piecewise Deterministic Markov Processes). We prove that the fixed point of the algorithm forms a bisimulation on the state space of the CPDP. We give sufficient conditions on the continuous dynamics and the transition structure of a CPDP, for the computation of the algorithm to be decidable.

show abstract

Compositional Modelling of Stochastic Hybrid Systems

Cited by 11 publications

References 58 publications

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

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

Value passing for communicating piecewise deterministic Markov processes

Algorithmic bisimulation for Communicating Piecewise Deterministic Markov Processes

Contact Info

Product

Resources

About