Communicating Piecewise Deterministic Markov Processes

A Composition Operator for Systems with Active and Passive Actions

“…Another interesting question is whether stochastic aspects can be incorporated in the | P A |-active/passive framework. In [12], we see the use of |Σ ∅ | enhanced with stochastic aspects for the specification of Piecewise Deterministic Markov Processes.…”

Value passing for communicating piecewise deterministic Markov processes

“…In [4], [6], the modelling framework CPDP is introduced. CPDP stands for Communicating Piecewise Deterministic Markov Process.…”

Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains

“…In addition, a new characterization of transient probabilities is provided for rate functions that are piecewise uniform. In contrast to works on communicating PDPs [SvdS06,SJvdS03,SvdS05], this paper considers weak bisimulation, congruence results and axiomatization, and, more importantly a notion of bisimulation which respects maximal progress. Current work consists of investigating improvements to the quotienting algorithm akin to [DPP04], model-checking algorithms [Kat06], and simulation relations for ICTMCs.…”

“…The probabilistic nature of mode transitions in PDPs is as for ICTMCs; in fact, ICTMCs are a subclass of PDPs when the global time t has a clock dynamics i.e.,ṫ = 1. The notion of parallel composition of ICTMCs corresponds to that for communicating PDPs (CPDPs) as introduced by Strubbe and van der Schaft [SvdS06,SJvdS03]. Alternative modeling formalisms for PDPs are, e.g., variants of colored Petri nets [EB05] but they lack a clear notion of compositionality.…”