ACM Home Page
Please provide us with feedback. Feedback
Petri-net evaluation using APL2
Full text PdfPdf (1.17 MB)
Source International Conference on APL archive
Proceedings of the international conference on APL table of contents
St. Petersburg, Russia
Pages: 286 - 300  
Year of Publication: 1992
ISBN:0-89791-477-5
Also published in ...
Author
Sponsors
SovAPL :
FinnAPL :
SIGAPL: ACM Special Interest Group on APL Programming Language
USSR Academy of Sci : USSR Academy of Sci
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Citation Count: 0
Additional Information:

abstract   references   index terms   peer to peer  

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

ABSTRACT

A Petri net is a graphical and mathematical modeling tool useful in the analysis of concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic systems. In addition, interest in Petri nets is increasing in the software community to model the behavior of parallel computer programs. The introduction of timed Petri nets allows system or program performance to be estimated as well. This paper begins with a general discussion, including definitions, for both ordinary and timed Petri nets. Several analysis tools are outlined for ordinary and timed Petri nets including analysis of the incidence matrix, coverability tree, firing diagram, and the GRID (Graph of Reachable Instantaneous Descriptions). This paper then introduces a method for representing Petri nets in APL2 and defines an easy input method. An APL2 implementation of each of the above analysis tools is given. These functions are described in detail as to their operation. Several examples of their use are given including examples of deadlock detection and performance estimation.


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
F. Archet/i, et.al., A Petri net modeling of a highly concurrent machine, 5th International Conference on Systems Engineering, Sept 1987, p 389'93
 
2
 
3
R.H. Gallard, An Extension in the Definition of a Petri Net Execution, The Computer Journal, vol. 30, no. 1, 1987, p.16-19
 
4
 
5
 
6
 
7
 
8
Jan Magott, Performance Evaluation of Concurrent Systems using Petri nets, Information Processing Letters, vol. 18, no. 1, 1984, p.7-13
9
 
10
 
11
Michael K. Molloy, Performance Analysis u:~ing Stochastic Petri Nets, IEEE Transactions on Computers, Vol. C-31, No. 9, p.913-917, Sept 1982
 
12
 
13
Tadao Murata, Petri Nets: Properties, Analysis and Applications, Proceedings of the IEEE, vol. 77, no. 4, April 1989, p.541-580
 
14
Jerre Noe and Gary J. Nutl, Macro E-nets for representation of Parallel systems, IEEE Transactions on Computers, Vol. C-22, No. 8, p.718-727, Aug 1973
 
15
Daniel Pease, Parallel Processors and Processing, CSE 763 Lecture notes, Syracuse University, 1987
 
16
C.V. Ramamoorthy and Gary S. Ho, Performance Evaluation of Asynchroous Concurrent Systems using Petri Nets, IEEE Transactions on Software Engineering, VoI.SE-6, No. 5, p.440-449, Sept 1980
 
17
 
18
Wiedzimiers M. Zuberek, Performance Evaluation using Extended Timed Petri Nets, p.272-8 (1985;)
 
19
Wiedzimiers M. Zuberek, Timed Petri Nets and Preliminary Performance Evaluation, 1980


Peer to Peer - Readers of this Article have also read: