Showing papers on "Process architecture published in 1976"

Petri net language

Abstract: In a labeled Petri Net we assign symbols from an alphabet to some or all the transitions of a Petri Net. To each firing sequence of such a Labeled Petri Net corresponds to a string over the alphabet. We study the languages obtained in this way by all firing sequences of a Petri Net, or by all firing sequences which reach a given final marking. We consider the closure properties of these languages, their characterization, their relation to other language families, and the decidability of various problems concerning these languages. The last chapter relates Petri Nets to Counter Automata and Weak Counter Automata, introduces inhibitor Nets and Priority Nets, and considers extensions and limitations of the Petri Net Languages.

Petri nets as a common tool for design verification and hardware simulation

Abstract: An APL simulation is developped in the case of parallel systems which communicate with the environment. This method using interpreted PETRI nets, helps the design verification.

The Petri net as a modeling tool

Abstract: The Petri net model is presented as a modeling tool for coordination of asynchronous processes. The Petri net is defined and shown to be both flexible in representing concurrency and easy to comprehend. An extended Petri net model is introduced, and its greater flexibility for coordination modeling is demonstrated. The Cigarette Smokers' Problem is modeled with a Petri net, and a Producer - Consumer Problem is solved with the extended Petri net. The net is briefly evaluated with mention of results of an experimental high-level language simulation of the extended Petri net.