|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2006, Volume 6, Issue 1, Pages 14–42
(Mi vngu223)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Equivalences for stochastic Petri nets and stochastic process algebras
P. Buchholza, I. V. Tarasyukb a GERMANY, D-44221, Dortmund,
Department of Computer Science,
University of Dortmund
b A. P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
A new class of stochastic Petri nets (SPNs) is proposed that is a modification of discrete time SPNs (DTSPNs) by transition labeling. The class is called labeled DTSPNs (LDT- SPNs). The observable behavior of a LDTSPN is described by labeling of transitions with actions that represent elementary activities. The dynamic behavior of LDTSPNs is defined, and the corresponding discrete time Markov chain (DTMC) is constructed. Behavioural equivalences of LDTSPNs are introduced as variants of well-known trace and bisimulation relations. Interrelations of all the mentioned equivalence relations are investigated. A logical characterization of the equivalences is presented via formulas of probabilistic modal logics. It is demonstrated how the equivalences can be used to compare stationary behavior of LDT-SPNs. A stochastic process algebra is proposed with formulas specifying a special subclass of LDTSPNs.
Received: 01.11.2004
Citation:
P. Buchholz, I. V. Tarasyuk, “Equivalences for stochastic Petri nets and stochastic process algebras”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 6:1 (2006), 14–42
Linking options:
https://www.mathnet.ru/eng/vngu223 https://www.mathnet.ru/eng/vngu/v6/i1/p14
|
Statistics & downloads: |
Abstract page: | 154 | Full-text PDF : | 66 | References: | 32 | First page: | 1 |
|