Showing papers on "Process architecture published in 1981"
TL;DR: To connect the abstract ideas of events and domains of information, it is shown how casual nets induce certain kinds of domains where the information points are certain sets of events, which allows translations between the languages of net theory and domain theory.
987 citations
TL;DR: It is shown how Petri nets can be generalized to allow processes to be described by a common subnet, without losing the ability to distinguish between them.
639 citations
01 Apr 1981
TL;DR: With the proposed state equation, all the logic operations hitherto not covered, can be conveniently represented using general form and this makes it possible to analyze the Petri net model of a computer.
Abstract: The representation of a Petri net is given with state equations more general than those described by Murata. With the proposed state equation, all the logic operations hitherto not covered, can be conveniently represented using general form. This makes it possible to analyze the Petri net model of a computer.
6 citations
01 Jan 1981
TL;DR: The ECMA transport protocol allows correction of the errors signaled by the network level, by using a window mechanism and control frames for acknowledgments and rejections, and the correctness of the data transfer is demonstrated using invariants.
Abstract: After a brief introduction to the theory of Petri nets, the ECMA transport protocol is presented. Then a model of the connection and disconnection phases is developed. Properties of correctness are demonstrated, using Petri net theory results, namely, reductions and linear invariants techniques. Predicate/transition nets are introduced and the underlying network service is modeled. Then a model of the data transfer phase is described. It allows correction of the errors signaled by the network level, by using a window mechanism and control frames for acknowledgments and rejections. The correctness of the data transfer is demonstrated using invariants. The service provided to the upper level is thus validated.
2 citations