Stochastic Petri Box Calculus with Discrete Time

Article type: Research Article

Authors: Tarasyuk, Igor V.

Affiliations: A.P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Sciences 6, Acad. Lavrentiev ave., 630090 Novosibirsk, Russia. E-mail: [email protected]

Abstract: In the last decades, a number of stochastic enrichments of process algebras was constructed to allow one for specification of stochastic processes within the well-developed framework of algebraic calculi. In [40], a continuous time stochastic extension of finite Petri box calculus (PBC) was proposed called sPBC. The algebra sPBC has interleaving semantics due to the properties of continuous time distributions. At the same time, PBC has step semantics, and it could be natural to propose its concurrent stochastic enrichment. We construct a discrete time stochastic extension dtsPBC of finite PBC. A step operational semantics is defined in terms of labeled transition systems based on action and inaction rules. A denotational semantics is defined in terms of a subclass of labeled discrete time stochastic Petri nets (LDTSPNs) called discrete time stochastic Petri boxes (dts-boxes). A consistency of both semantics is demonstrated. In addition, we define a variety of probabilistic equivalences that allow one to identify stochastic processes with similar behaviour which are differentiated by too strict notion of the semantic equivalence. The interrelations of all the introduced equivalences are investigated.

Keywords: Stochastic Petri nets, stochastic process algebras, Petri box calculus, discrete time, transition systems, operational semantics, dts-boxes, denotational semantics, empty loops, probabilistic equivalences

Journal: Fundamenta Informaticae, vol. 76, no. 1-2, pp. 189-218, 2007