Abstract: In this paper we introduce CPDPs (Communicating Piecewise Deterministic Markov Processes) as an automata formalism for compositional specification of hybrid systems of the type PDP. A CPDP can be seen as an automaton representation of a PDP, with the extra possibility of interaction with other processes via a new concept that we call passive transitions. In order to compose two CPDPs, we define a composition operator on CPDPs and we show that the class of CPDPs is closed under this operator.
In REF , Strubbe et al. introduce Communicating Piecewise Deterministic Markov Processes (CPDP).
COMMUNICATING PIECEWISE DETERMINISTIC MARKOV PROCESSES
ADHS
Mathematics Computer Science