ACM Home Page
Please provide us with feedback. Feedback
On generation of state space for timed Petri nets
Full text PdfPdf (1,000 KB)
Source ACM Annual Computer Science Conference archive
Proceedings of the 1988 ACM sixteenth annual conference on Computer science table of contents
Atlanta, Georgia, United States
Pages: 239 - 248  
Year of Publication: 1988
ISBN:0-89791-260-8
Author
W. M. Zuberek  Department of Computer Science, Memorial University of Newfoundland, St. John's, Newfoundland, Canada A1C 5S7
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 20,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322609.322648
What is a DOI?

ABSTRACT

It is shown that the behavior of timed Petri nets with deterministic firing times (D-timed nets) and with exponentially distributed random firing times (M-timed nets) can be described within one uniform formalism. Moreover, for both classes of nets the state spaces are homogeneous semi-Markov chains, the stationary probabilities of states and many performance measures can thus be obtained by standard techniques developed for analysis of Markov processes. Because of scarcity of nets as well as corresponding systems of equilibrium equations, list structure representations are proposed, and a general procedure for generation of the state space is outlined to show the required processing of list structures.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
T. Agerwala, "Putting Petri nets to work"; IEEE Computer, vol.12, no.12, pp.85-94, 1979.
2
 
3
W. Brauer, W. Reisig, G. Rozenberg (eds.), "Advances in Petri Nets 1986" (vol.l: "Petri nets- central models and their properties", vol.2: "Petri nets- applications and relationship to other models of concurrency"); Proc. of the Advanced Course, Bad Honnef, 1986; Lecture Notes in Computer Science 254 and 255, Springer ~erlag 1987.
 
4
3.P. Buzen, "Fundamental operational laws of computer system performance"; Acta Information, vol.7, no.2, pp.167-182, 1976.
 
5
 
6
 
7
 
8
 
9
L. Kleinrock, "Queueing systems", vol.l: "Theory", vol.2: "Computer applications"; J. Wiley & Sons 1975, 1976.
 
10
P.M. Merlin, D.J. Farber, "Recoverability of communication protocols- implications of a theoretical study"; IEEE Trans. on Communications, vol.24, no.0, pp.103~-1049, 1976.
 
11
M.K. Molloy, "Performance analysis using stochastic Petri nets"; IEEE Trans. on Computers, vol.31, no.9, pp.913-917, 1982.
 
12
 
13
 
14
15
 
16
 
17
 
18
 
19
 
20
A.A. Torn, "Simulation nets, a simulation, modelling and validation tool"; Simulation Journal, vo1.45, no.2, pp.71-75~ 1985.
 
21
 
22
W.M. Zuberek, "Inhibitor D-timed Petri nets and performance analysis of communication protocols"; INFOR Journal, vol.24, no.3, pp.231-249, 1986.
 
23
W.M. Zuberek, "TPNEV, an interactive program for evaluation of timed Petri nets"; Technical Report, Department of Computer Science, Memorial University of Newfoundland, St. John's, Canada AIC 5S7 (in preparation).