Showing papers on "Process architecture published in 1973"
09 Dec 1973
TL;DR: The capabilities and limitations of Petri nets are examined and techniques for proving their correctness are investigated and the feasibility of using the methods of computational induction and inductive assertions to prove restricted statements about Petrinets is established.
Abstract: In this paper we examine the capabilities and limitations of Petri nets and investigate techniques for proving their correctness. We define different classes of nets where each is basically a Petri net with slight modifications and study the relationship between the various classes. One particular class appears to be quite powerful, with respect to its capability for representing coordinations. In the second part of the paper we establish the feasibility of using the methods of computational induction and inductive assertions to prove restricted statements about Petri nets.
90 citations
TL;DR: A valid fix for any PM net is presented, showing that the cjigprette Smokers’ Roblem is solvable without CrgndifiolRltls if one uses semaphos axrays and his result was extended by Habermann to the case of the ‘~-0ut43fn” nets.
1 citations
01 Jul 1973
TL;DR: Any system where there are loosely connected essentially independent processes that proceed in an asynchronous marner can be modelled using Petri nets and should be useful in modelling business systems and biological systems.
Abstract: Petri nets were one of the earliest contributions to the theory of parallel computations and appear to be a natural way to represent the coordination of asynchronous events. Petri nets, however, are not restricted to modelling coordinates in computer systems. Any system where there are loosely connected essentially independent processes that proceed in an asynchronous marner can be modelled using Petri nets and should be useful in modelling business systems and biological systems. (MCW)
1 citations