A description of path expressions by Petri nets

Authors:
P. E. Lauer;R. H. Campbell
Affiliations:
University of Newcastle upon Tyne, Claremont Tower, Claremont Road, Newcastle upon Tyne, England;University of Newcastle upon Tyne, Claremont Tower, Claremont Road, Newcastle upon Tyne, England
Venue:
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1975

Citing 0
Cited 5

Beyond programming languages

Communications of the ACM
Survey of recent operating systems research, designs and implementations

ACM SIGOPS Operating Systems Review
Parallelism, control and synchronization expression in a single assignment language

ACM SIGPLAN Notices
Abstract specification of resource accessing disciplines: adequacy, starvation, priority and interrupts

ACM SIGPLAN Notices
Occurrence nets then and now: the path to structured occurrence nets

PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets

Quantified Score

Hi-index	0.02

Visualization

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.