ACM Home Page
Please provide us with feedback. Feedback
A description of path expressions by Petri nets
Full text PdfPdf (786 KB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages table of contents
Palo Alto, California
Pages: 95 - 105  
Year of Publication: 1975
Authors
P. E. Lauer  University of Newcastle upon Tyne, Claremont Tower, Claremont Road, Newcastle upon Tyne, England
R. H. Campbell  University of Newcastle upon Tyne, Claremont Tower, Claremont Road, Newcastle upon Tyne, England
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 30,   Citation Count: 3
Additional Information:

abstract   references   cited by   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/512976.512987
What is a DOI?

ABSTRACT

Petri nets are used to define a path and process notation which is more general in its ability to express synchronization than previous path notations. The Petri net classes corresponding to the path notation prove to be interesting in their own right and have demonstrable properties such as liveness and safeness.


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
Campbell, R. H. and Habermann, A. N.: The Specification of Process Synchronization by Path Expressions, University of Newcastle upon Tyne, Computing Laboratory, Technical Report Series, No. 55).
 
2
Campbell, R. H. and Lauer, P. E.: A Spectrum of Solutions to the Cigarette Smokers Problem, An application of the description of path expressions by Petri nets, Computing Laboratory, Newcastle upon Tyne, Technical Report Series, No. 63.
 
3
Dijkstra, E. W.: Co-operating Sequential processes. (In Programming Languages, F. Genuys, Ed. Academic Press, New York, 1968).
 
4
Lauer, P. E.: Path Expressions as Petri Nets, or Petri Nets with Fewer Tears, MRM 70, Computing Laboratory, University of Newcastle upon Tyne, 10 January, 1974.
 
5
Lautenbach, K.: Exakte Bedingungen der Lebendigkeit für eine Klasse von Petri-Netzen, BMFT-GMD-82, Gesellschaft Für Mathematik und Daten-Verarbeitung, Bonn, 1973.
 
6
Hack, M. H. T.: Analysis of Production Schemata by Petri Nets, Masters Thesis, MIT, Feb., 1972.
 
7
Holt, A. W. and Commoner, F.: Events and Conditions, Applied Data Research, New York 1970.
 
8
Petri, C. A.: Kommunikation mit Automaten (Communication with Automata) Ph.D. Thesis 1962, Technische Hochschumacr;le, Darmstadt.
 
9
Schmid, H. A.: An Approach to the Communication and Synchronization of Processes, In: International Computing Symposium 1973 (Eds. Gunther, A. et al) North-Holland Publ. Co. 1974.
 
10
Riddle, W. E.: A Comparison of Path Expressions and Message Transfer Expressions, Systems Research Memo SRM/93, The University of Newcastle upon Tyne Computing Laboratory, 3 July, 1974.
 
11
Riddle, W. E.: The Equivalence of Petri Nets and Message Transfer Models, Systems Research Memo SRM/97, The University of Newcastle upon Tyne Computing Laboratory, 21 August, 1974.
 
12
Peterson, J. L. and Bredt, T. H.: A comparison of models of parallel computation, Proc. IFIP Congress 1974, Stockholm, August 1974, North Holland, Amsterdam 1974, pp. 466-470.

Collaborative Colleagues:
P. E. Lauer: colleagues
R. H. Campbell: colleagues