On the Modelling Power of Petri Nets

Thumbnail
View/Open
PERMANENT LINK(S)
http://hdl.handle.net/1813/7516
Collections
Metadata
Show full item record
Author
Meiling, Erik
Abstract
The behavior of a Petri net is expressed as a formal language. Certain families of Petri net languages are characterized by propositions similar to the classical pumping theorems. The results are used to give examples of behaviors that cannot be expressed by languages in these families.
Date Issued
1979-12
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR79-403
Type
Technical Report

Statistics