A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
M-timed Petri nets and Markov chains in modelling of computer systems
1986
Proceedings of the 1986 ACM fourteenth annual conference on Computer science - CSC '86
It is shown that the behavior of enhanced free-choice bounded M-timed Petri nets, i.e., Petri nets with two classes of transitions, immediate and timed ones, and with exponentially distributed firing times of timed transitions, can be represented by state-transition graphs which are finite continuous-time homogeneous Markov chains. Moreover, for each finite continuous-time homogeneous Markov chain there exists an enhanced free-choice bounded M-timed Petri net with the state-transition graph
doi:10.1145/324634.325210
dblp:conf/acm/Zuberek86
fatcat:t2r5z5zbfvfbjeicenj57maqba