M. Koutny and E. Best. Operational and denotational semantics for the box algebra. Theoretical Computer Science, 211:1--83, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....basic models will be presented, introducing open Petri nets. Open Petri nets are nets with a distinguished set of places which are intended to represent the interface of the net towards the external world. Some similarities exist with other approaches to net composition, like Petri box calculus [11, 13, 23], the Petri nets with interface [15, 20] and the Petri net components [17] As a consequence of the (hidden, implicit) interaction between the net and the environment, some tokens can freely appear Introduction vi in, or disappear from, the open places. Moreover, net class transformations ....

....in [28] This category is fully provided within the framework of this report. Category oPT of Open Place Transition Nets Open place transition nets are introduced for the rst time in [29, 30] Some similarities exist with other approaches to net composition like, for example, Petri box calculus [11, 13, 23], the Petri nets with interface [15, 20] and the Petri net components [17] Category oEN of Open Elementary Nets The category oEN is introduced for the rst time in the context of this report. It is an enhancement of the category EN analogous to the category oPT. Category oAHL of Open Algebraic ....

M. Koutny and E. Best. Operational and denotational semantics for the box algebra. Theoretical Computer Science, 211(1-2):1-83, 1999.

.... A proper formal model of CA actions is also needed two promising starting points for such a model are the work of our colleagues at EPFL on CO OPN2, a specification language for concurrent object oriented systems [Biberstein, Buchs et al. 1997] and work here at Newcastle on Petri Box Algebra [Koutny and Best 1997]. Last but not least, we would also like to extend the CA action concept so as to make it suitable for use in real time systems. It is possible to draw an interesting parallel between the use of the present CA action scheme for structuring the behaviour of a system in the value domain, and the ....

M. Koutny and E. Best, "Operational and Denotational Semantics for the Box Algebra," to appear in Theoretical Computer Science, 70 pages, 1997.

....basic model introducing open nets. An open net is a P T Petri net with a distinguished set of places which are intended to represent the interface of the net towards the external world. Some similarities exist 2 with other approaches to net composition, like the Petri box calculus [BDH92, KEB94, KB99] the Petri nets with interface [NPS95, PW98] and the Petri net components [Kin97] which will be discussed in the conclusions. As a consequence of the (hidden, implicit) interaction between the net and the environment, some tokens can freely appear in or disappear from the open places. Besides ....

....A second, more recent class of approaches to Petri net composition aims at defining a calculus of nets , where a set of process algebra like operators allows to build complex nets starting from a suitable set of basic net components. For instance, in the Petri Box calculus [BDH92, KEB94, KB99] a special class of nets, called plain boxes (safe and clean nets) provides the basic components. Plain boxes are then combined by means of operations which can all be seen as an instance of refinement over suitable nets. More precisely, the authors identify a special family of nets, called ....

M. Koutny and E. Best. Operational and denotational semantics for the box algebra. Theoretical Computer Science, 211(1--2):1--83, 1999.

.... A proper formal model of CA actions is also needed two promising starting points for such a model are the work of our colleagues at EPFL on CO OPN2, a specification language for concurrent object oriented systems [Biberstein, Buchs et al. 1997] and work here at Newcastle on Petri Box Algebra [Koutny and Best 1997]. Last but not least, we would also like to extend the CA action concept so as to make it suitable for use in real time systems. It is possible to draw an interesting parallel between the use of the present CA action scheme for structuring the behaviour of a system in the value domain, and the use ....

M. Koutny and E. Best, "Operational and Denotational Semantics for the Box Algebra," to appear in Theoretical Computer Science, 70 pages, 1997.

No context found.

M. Koutny and E. Best. Operational and denotational semantics for the box algebra. Theoretical Computer Science, 211:1--83, 1999.

No context found.

M. Koutny and E. Best. Operational and denotational semantics for the box algebra. Theoretical Computer Science, 211:1--83, 1999.

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