JavaScript is disabled for your browser. Some features of this site may not work without it.
On the Modelling Power of Petri Nets
| dc.contributor.author | Meiling, Erik | en_US |
| dc.date.accessioned | 2007-04-23T18:25:17Z | |
| dc.date.available | 2007-04-23T18:25:17Z | |
| dc.date.issued | 1979-12 | en_US |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR79-403 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7516 | |
| dc.description.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. | en_US |
| dc.format.extent | 941315 bytes | |
| dc.format.extent | 244245 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On the Modelling Power of Petri Nets | en_US |
| dc.type | technical report | en_US |
