Piecewise deterministic Markov processes represented by dynamically coloured Petri nets
\textit{M. H. A. Davis} [J. R. Stat. Soc., Ser. B 46, 353--388 (1984; Zbl 0565.60070)] introduced piecewise deterministic Markov processes (PDPs) as a general class of continuous-time Markov processes which includes both discrete and continuous processes, except diffusion. Petri nets and their many extensions, see e.g. \textit{R. David} and \textit{H. Alla} [Automatica 30, No. 2, 175--202 (1994; Zbl 0800.93022)] for a good overview, have proven to be extremely useful in developing models for various complex practical applications. The aim of this paper is to introduce a new class of hybrid Petri nets and to show that there exists into-mappings between this new class of hybrid Petri nets and the class of PDPs. The existence of such into-mappings allows combining the compositional specification power of Petri nets with the stochastic analysis and control power of PDPs. The idea of establishing into-mappings between Petri nets and stochastic processes in order to combine advantages of both classes is developed for finite state processes by \textit{K. S. Trivedi}, \textit{G. Ciardo}, \textit{M. Malhotra} and \textit{S. Garg} [in: Computational probability. Lect. Notes Control Inf. Sci. 199, 144--157 (1994; Zbl 0825.68473)], and \textit{J. K. Muppala}, \textit{R. M. Fricks} and \textit{K. S. Trivedi} [Int. Ser. Oper. Res. Manag. Sci. 24, 445--479 (2000; Zbl 0945.65011)] developed a hierarchy of various dependability models based on their modelling power. In this hierarchy continuous-time Markov chains (CTMC) on the one hand and generalised stochastic Petri nets (GSPN) on the other hand have been well established for developing CTMC for complex practical discrete-valued applications. As shown by M. H. A. Davis (loc. cit.) CTMC form a particular subclass of PDPs. This paper extends the power hierarchy with PDPs and with PDP-related Petri nets.
- Colored decision process Petri nets modeling analysis and stability
- Hybrid Petri nets with diffusion that have into-mappings with generalised stochastic hybrid processes
- Communicating piecewise deterministic Markov processes
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
- Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms
- On the Use of the Power Series Algorithm for General Markov Processes, with an Application to a Petri Net
- Reachability questions in piecewise deterministic Markov processes
- Bisimulation for communicating piecewise deterministic Markov processes (CPDPs)
- Model checking HPnGs in multiple dimensions: representing state sets as convex polytopes
This page was built for publication: Piecewise deterministic Markov processes represented by dynamically coloured Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460723)