Communicating Piecewise Deterministic Markov Processes

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.

[1]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  A. Schaft,et al.  Stochastic equivalence of CPDP-automata and piecewise deterministic Markov processes , 2005 .

[4]  van der Arjan Schaft,et al.  On control of complex stochastic hybrid systems , 2005 .

[5]  Henk A. P. Blom,et al.  Piecewise deterministic Markov processes represented by dynamically coloured Petri nets , 2005 .

[6]  Henk A. P. Blom,et al.  Petri-Nets and Hybrid-State Markov Processes in a Power-Hierarchy of Dependability Models , 2003, ADHS.

[7]  Mark H. Davis.  Markov Models and Optimization , 1995 .

[8]  Arjan van der Schaft,et al.  Bisimulation of Dynamical Systems , 2004, HSCC.

[9]  Nancy A. Lynch,et al.  Hybrid I/O Automata Revisited , 2001, HSCC.

[10]  Mark H. A. Davis.  Piecewise‐Deterministic Markov Processes: A General Class of Non‐Diffusion Stochastic Models , 1984 .

[11]  Pedro R. D'Argenio,et al.  Algebras and Automata for Timed and Stochastic Systems , 1999 .

[12]  Arjan van der Schaft,et al.  Bisimulation for Communicating Piecewise Deterministic Markov Processes (CPDPs) , 2005, HSCC.

[13]  Luigi Logrippo,et al.  An Introduction to LOTOS: Learning by Examples , 1992, Comput. Networks ISDN Syst..

[14]  J. M. Schumacher,et al.  Compositionality issues in discrete, continuous, and hybrid systems , 2001 .

[15]  Arjan van der Schaft,et al.  Control of Hybrid Behavioral Automata by Interconnection , 2003, ADHS.

[16]  H.A.P. Blom,et al.  Piecewise Deteministic Markov Processes represented by Dynamically Coloured Petri Nets , 1999 .

[17]  Holger Hermanns,et al.  Interactive Markov Chains , 2002, Lecture Notes in Computer Science.

[18]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[19]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..