REDUCTION OF PETRI NETS.

Larry L Kinney, Yih Wu Han

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations

Abstract

Petri nets and other labelled graphs have been widely used to model real systems and events. In order to make the application practicable, a hierarchical representation which suppresses unnecessary information is essential. Hence, techniques for expanding and reducing Petri nets are needed. This paper discusses the reduction of live and bounded Petri nets which possess the properties of consistency and invariancy.

Original languageEnglish (US)
Pages616-625
Number of pages10
StatePublished - Jan 1 1976
EventProc Annu Allerton Conf Circuit Syst Theory 14th - Monticello, IL, USA
Duration: Sep 29 1976Oct 1 1976

Other

OtherProc Annu Allerton Conf Circuit Syst Theory 14th
CityMonticello, IL, USA
Period9/29/7610/1/76

Fingerprint

Dive into the research topics of 'REDUCTION OF PETRI NETS.'. Together they form a unique fingerprint.

Cite this