C.A. Petri (1973), Concepts of Net Theory, in Proceedings of MFCS 73, 137--146, Mathematics Institute of the Slovak Academy of Science.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....whose set of equations is empty, and with RA having a rewrite rule l : x y for each (x; l; y) 2 T . So far so good, but we have not yet seen any concurrency. The simplest concurrent system examples are probably the concurrent automata called Petri nets after their proponent, Carl Adam Petri [41]. Consider for example the picture, 24 buy c buy a change P P P P P P Pq ) P P P P P P Pi c a q which represents a concurrent machine to buy cakes and apples. A cake costs a dollar and an apple three quarters. Due to an ....

C. A. Petri. Concepts of net theory. In Mathematical Foundations of Computer Science, pages 137-146. Mathematical Institute of the Slovak Academy of Sciences, 1973.

....of Petri nets is represented by occurrence nets and concurrent runs ( 4] cf. also [5] giving a formal and simultaneously visual represenation of events flow and casual dependencies on transitions. Conventionally occurrence nets semantics is defined for contact free Petri nets. A contact [3] is a situation, when a transition is not enabled not because some of its input places do not contain enough tokens, but because some of its output places are occupied. It is well known that contacts can formally be excluded through the addition of place complements [5] 7] 9] However, as ....

Petri, C.A.: Concepts of Net Theory. In: Mathematical Foundations of Computer Science, Proc. Symposium and Summer School (Math.Inst.of the Slovak Acad. of Sciences, High Tatras, 1973) 137--146.

....to safe nets, while the standard coreflection between Occ and Dom, the category of finitary prime algebraic domains, when composed with the unfolding functor above, determines a chain of adjunctions between PTNets and Dom. Introduction Petri nets, introduced by C.A. Petri in [Pet62] see also [Pet73, Rei85]) are a widely used model of concurrency. This model is attractive from a theoretical point of view because of its simplicity and because of its intrinsically concurrent nature, and has often been used as a semantic basis on which to interpret concurrent languages (see for example [Win82, Old87, ....

C.A. Petri. Concepts of Net Theory. In proceedings of MFCS `73, pp. 137--146, Mathematics Institute of the Slovak Academy of Science, 1973.

....net N, the strongly concatenable processes of N are isomorphic to the arrows of Q (N) In addition, we identify a coreflection right adjoint to Q ( and characterize its replete image, thus yielding an axiomatization of the category of net computations. Introduction Petri nets, introduced by C.A. Petri in (Petri 1962) see also Petri 1973; Reisig 1985) are unanimously considered one of the most representative models for concurrency, since they are a fairly simple and natural model of concurrent and distributed computations. However, Petri nets are, in our opinion, not yet completely ....

C.A. PETRI (1973), Concepts of Net Theory. In Proceedings of MFCS `73, 137--146, Mathematics Institute of the Slovak Academy of Science.

....Helsinki University of Technology Phone: 90 358 0 4511 Department of Computer Science Digital Systems Laboratory Telex: 125 161 htkk fi Otaniemi, Otakaari 1 Telefax: 358 0 465 077 FIN 02150 ESPOO, FINLAND E mail: lab saturn.hut.fi 1 1 Introduction General Net theory as initiated by C.A. Petri (1973) is the study of Nets and their morphisms. A folding is a special kind of morphism between nets. It has been used to relate a net to its causal behaviors, its processes, and to describe and motivate High level Nets (Genrich, Lautenbach and Thiagarajan 1980) Recently the construction of strict ....

....; PN ; o; sorti; fg; f : gi where TG = TN ,PG = PN , the weighting functions ; o : TN (PN Theta fg) are by the equations G (t) 1 ( t) o G (t) 1 (o(t) 7 2.17 Lemma Unf(G(N ) N . 3 Foldings As stated earlier the aim of General Net Theory as introduced by C.A. Petri (1973) is to study morphisms of Nets. Foldings play a central role in this theory, because they are used to relate dioeerent nets and net classes. In this paper we are interested in the use of foldings to relate dioeerent net classes. A study of foldings using the classical notion of net morphism has ....

[Article contains additional citation context not shown here]

Petri, C. A.: 1973, Concepts of Net Theory, Mathematical Foundations of Computer Science, Math. Inst. of the Slovak Acad. of Science, pp. 137 146.

....nets; moreover, the standard coreflection between Occ and Dom, the category of finitary prime algebraic domains, when composed with the unfolding functor above, determines a chain of adjunctions between PTNets and Dom. Introduction Petri nets, introduced by C.A. Petri in (Petri 1962) see also Petri 1973; Reisig 1985) are a widely used model of concurrency. This model is attractive from a theoretical point of view because of its simplicity and because of its intrinsically concurrent nature, and has often been used as a semantic basis on which to interpret concurrent languages (see for example ....

Petri, C.A. (1973) Concepts of Net Theory. In Proceedings of MFCS 73, Mathematics Institute of the Slovak Academy of Science, 137--146.

....nets the same semantics as that of unfolding. In addition, we prove that the decorated processes of a net can be axiomatized as the arrows of a symmetric monoidal category which, therefore, provides the aforesaid unification. Introduction Petri nets, introduced by C.A. Petri in [22] see also [23, 25, 26]) are a widely used model of concurrency. This model is attractive from a theoretical point of view because of its simplicity and because of its intrinsically concurrent nature, # Supported by O#ce of Naval Research Contract N00014 92 C 0518, National Science Foundation grant CCR 9224005, and by ....

C.A. Petri. Concepts of Net Theory. In Proceedings of MFCS `73, pp. 137--146, Mathematics Institute of the Slovak Academy of Science, 1973.

....retraces, collects, summarises, and mildly extends the contributions of the authors both together and individually on the theme of representing the space of computations of Petri nets in its mathematical essence. Introduction Among the semantics proposed for Petri nets [10] see also [11, 13]) a relevant role is played by the various notions of process, e.g. 12, 5, 1] whose merit is to provide a faithful account of computations involving many different transitions and of the causal connections between the events occurring in computations. Bare process models, however, fail to bring ....

C.A. PETRI (1973), Concepts of Net Theory, in Proceedings of MFCS'73, Mathematics Institute of the Slovak Academy of Science, 137--146.

....nets without loops. 1 Introduction Net theory has been introduced in the early sixties by Carl Adam Petri [Pet] with the purpose of providing a conceptual tool to derive global system properties from given local properties, and detailed system requirements from global specifications [Pet73]. The application of Net Theory, in Petri s words, consists in the description, analysis and synthesis of systems and processes in the real world. Pet73] Net Theory has been widely developed during these years, becoming very popular as a framework for the analysis and specification of ....

....conceptual tool to derive global system properties from given local properties, and detailed system requirements from global specifications [Pet73] The application of Net Theory, in Petri s words, consists in the description, analysis and synthesis of systems and processes in the real world. [Pet73]. Net Theory has been widely developed during these years, becoming very popular as a framework for the analysis and specification of concurrent systems. Not all the basic concepts of Net Theory have received the same attention in these developments: among the ones to which very little attention ....

C.A. Petri. Concepts of net theory. In Mathematical Foundations of Computer Science. Proceedings of Symposium and Summer School, pages 137--146, Bratislava, 1973. Mathematical Institute of Slovak Academy of Sciences.

No context found.

C.A. Petri (1973), Concepts of Net Theory, in Proceedings of MFCS 73, 137--146, Mathematics Institute of the Slovak Academy of Science.

No context found.

C.A. Petri (1973), Concepts of Net Theory, in Proceedings of MFCS 73, 137--146, Mathematics Institute of the Slovak Academy of Science.

No context found.

C.A. Petri. Concepts of Net Theory. In proceedings of MFCS `73, pp. 137--146, Mathematics Institute of the Slovak Academy of Science, 1973.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC