DeepAI AI Chat
Log In Sign Up

Discrete time stochastic and deterministic Petri box calculus

05/01/2019
by   Igor V. Tarasyuk, et al.
nsk.su
0

We propose an extension with deterministically timed multiactions of discrete time stochastic and immediate Petri box calculus (dtsiPBC), previously presented by I.V. Tarasyuk, H. Macià and V. Valero. In dtsdPBC, non-negative integers specify multiactions with fixed (including zero) time delays. The step operational semantics is constructed via labeled probabilistic transition systems. The denotational semantics is defined on the basis of a subclass of labeled discrete time stochastic Petri nets with deterministic transitions. The consistency of both semantics is demonstrated. In order to evaluate performance, the corresponding semi-Markov chains and (reduced) discrete time Markov chains are analyzed.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/01/2019

Bisimulation for Feller-Dynkin Processes

Bisimulation is a concept that captures behavioural equivalence. It has ...
02/04/2021

On Stochastic Rewriting and Combinatorics via Rule-Algebraic Methods

Building upon the rule-algebraic stochastic mechanics framework, we pres...
01/09/2021

Quantization optimized with respect to the Haar basis

We propose a method of data quantization of finite discrete-time signals...
10/26/2018

On the Identifiability of the Influence Model for Stochastic Spatiotemporal Spread Processes

The influence model is a discrete-time stochastic model that succinctly ...
07/16/2021

On the discrete-time simulation of the rough Heston model

We study Euler-type discrete-time schemes for the rough Heston model, wh...
03/16/2023

Predicting discrete-time bifurcations with deep learning

Many natural and man-made systems are prone to critical transitions – ab...
09/17/2021

Probabilistic Stability Analysis of Planar Robots with Piecewise Constant Derivative Dynamics

In this paper, we study the probabilistic stability analysis of a subcla...