Scholarly Works

A description of path expressions by Petri nets

A description of path expressions by Petri nets

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.

Authors

Lauer PE; Campbell RH

Pagination

pp. 95-105

Publisher

Association for Computing Machinery (ACM)

Publication Date

January 1, 1975

DOI

10.1145/512976.512987

Name of conference

Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '75

Associated Experts

Peter Ernst Lauer

Professor Emeritus, Faculty of Engineering

Labels

Fields of Research (FoR)

4613 Theory Of Computation 46 Information and Computing Sciences

View published work (Non-McMaster Users)

Contact the Experts team

Get technical help

or

Provide website feedback