Bernardinello, L., Cindio, F.D.: A survey of basic net models and modular net classes. In Rozenberg, G., ed.: Advances in Petri Nets: The DEMON Project. Volume 609 of Lecture Notes in Computer Science. Springer-Verlag (1992) 304-- 351  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... logic for the uni cation of Petri nets has been investigated in [Mes92] Another line of research follows the idea to present abstract description of Petri nets and their semantics, for example [GR83,Win87,MM90,Sas98] The classi cation of Petri nets and their extensions as investigated in [BDC92,DA94,KW98] is an important basis for the identi cation of further parameters. In [KW98] an approach has been introduced that focuses on describing orthogonal dimensions of Petri net notions. These dimensions can be considered as parameters as well. Since the sole topic of this book concerns ....

L. Bernardinello and F. De Cindio. A survey of basic net models and modular net classes. In Advances in Petri Nets'92, pages 304-351. Springer LNCS 609, 1992.

....blocking relation, coloured FIFO nets, compositionality, equal conflict, freeing relation, liveness, non constraining relation, state machine, synchronization, synchronization medium. 1 Introduction Compositional specification and validation are fundamental for handling large Petri net models [BC92]. Modular analysis reduces the cost of handling the entire systems. Local properties of each component net can be checked separately and composition rules allow to preserve some global properties. Communication protocols constitute a privileged field for composition of Petri nets [Dia87] BWWH88] ....

L. Bernardinello and F. De Cindio. A survey of basic net models and modular net classes. In Advances in Petri Nets 1992, volume 609 of LNCS. Springer-Verlag, 1992.

....and composition mechanisms in Petri nets is still a major weakness [12] Various forms of graphical folding mechanisms [7] 20] have been proposed but only aid in information hiding and not in the composition of nets. Modularisation, including composition, proposals include those described in [2], 9] which also presents module refinement techniques) and Hierarchical Coloured Petri Nets [13] Recently there have been attempts to combine the structuring techniques of object oriented programming with Petri nets [6] 14] 24] Allowing behaviour to be described with a Petri net enables ....

Bernardinello L., De Cindio F., A Survey of Basic Net Models and Modular Net Classes, Lecture Notes in Computer Science 609, Springer Verlag 1992

.... the proposal contains the following relational structures: Labelled Graphs, as a very general purpose formalism to represent non deterministic relationships; LabelledAND OR Graphs and different classes of Labelled Petri Nets, as means to represent causal relationships in presence of concurrency [2]. All of them are grounded on a sound mathematical theory providing algorithms for animation, simulation and analysis that can be exploited in the implementation of the primitives. All structures have associated labelling functions to express the interpretation of their constitutive elements, ....

Bernardinello, Luca, and Fiorella De Cindio: "A Survey of Basic Net Models and Modular Net Classes," in G. Rozenberg (ed.) Advances in Petri Nets 92, LNCS 609, Springer-Verlag, Berlin, Germany, 1992, pp. 304-351.

....involve the global computation. While Petri nets and temporal logic are good at describing properties that pertain to the complete systems, however, they are relatively unstructured and not ideal for compositional verification[12] Recent work on the compositionality or modularity of Petri nets[7, 2, 3, 11] and the emergence of high level timed Petri nets[8, 18] has made them more attractive to the specification and analysis of complex real time systems. Although some work has been reported to give rigorous interpretation to the SA RT requirement model via Petri nets, time has been taken into ....

L. Bernardinello and F. De Cindio. A Survey of Basic Net Models and Modular Net Classes. In LNCS 609: Advances in Petri nets, pages 304--351. 1992.

....consumer operation ConsIt. It is a way for realising synchronisation and information exchange. Composition Objects A set of techniques that have been proposed for constructing large nets consist of composing nets. Depending on the composition operator (such as place and or transition merging [4], medium composition [20] mechanisms are offered for modelling synchronous and asynchronous communication between get item consume object net produce send INE Interface Producer Interface ConsIt object net Consumer invoke ConsIt INE Figure 2: Producer and consumer: client server ....

L. Bernardinello and F. De Cindio. A Survey of Basic Net models and Modular Net Classes. In Advances in Petri Nets 1992, pages 304--351, 1992.

....technique; this allows us to address the problem of mitigating the high inefficiency diagnostic algorithms usually have. 1 Introduction Backward reachability on Petri net models has been proposed since the beginning of the development of net theory (e.g. in the Condition Event systems [1]) without giving it a suitable motivation. For this reason, reachability analysis has been successively developed essentially by taking into account forward reachability. However, progresses in fields like Artificial Intelligence (AI) showed that a lot of different practical tasks require ....

L. Bernardinello and F. De Cindio. A survey of basic net models and modular net classes. In G. Rozenberg, editor, Advances in Petri Nets 1992, LNCS 609, pages 304--

....to face the problem. Since the behavior of the systems of interest can be described by means of sets of definite clauses, the net model we need can be defined by means of a translation procedure from a set of definite clauses. Let us briefly review some basic definitions concerning net models [1]: 6 The logical description used in the present paper can also be applied to behavioral models which do not explicitly rely on causal knowledge (see [8] 7 For instance, the admissible values of the state s could be fnormal; abnormalg, but if the model were a pure fault model, the only ....

.... net) is a P T system such that: 8s 2 S K(s) 1 and 8f 2 F W (f) 1; it can be denoted as Sigma = S; T; F; M 0 ) we will use Sigma = S; T; F; W;M 0 ) when W needs to be explicit) Since we are interested in (ordinary) Petri nets, we use the following definition adapted from definition 8 of [1]. Definition4. Let Sigma = S; T; F; W;M 0 ) be a Petri net; a marking is a function M : S N ; a transition t 2 T is enabled at M iff 8s 2 S M (s) 1; if t is enabled at M , then t may occur (fire) yielding a new marking M 0 such that for every place s 2 S we have M 0 (s) M (s) Gamma ....

L. Bernardinello and F. De Cindio. A survey of basic net models and modular net classes. In G. Rozemberg, editor, Advanced in Petri Nets 1992, LNCS 609, pages 304--

....bound to this philosopher. For the other example, the inter agent synchronisation comes down to a simple transition synchronisation. These inter agents synchronisation specifications in general cannot be described by traditional composition operations, such as transition merging (as overviewed in [BC92]) The multi model principle requires new mechanisms for specifying relationships between different net models, such as multi model synchronisation. Multi model synchronisation specifications are a mechanism for interconnecting different agents. In this paper, multi model synchronisation of ....

L. Bernardinello and F. De Cindio. A Survey of Basic Net Models and Modular Net Classes. In Advances in Petri Nets '92, pages 304--351, 1992.

....M 0 iff f M t e N f M 0 . The importance of this property consists in the facts that it allows us, via property 3.7, to concentrate our analysis on P T net systems, that are easy to handle in linear logic, but to use in practice P T nets, that are a better model of the real world. See [5] for a comparison between these and other net models. 3.4 Other net models Although P T nets are very general and expressive, restrictions of this net model are often prefered. In this section, we will briefly discuss two such restrictions, elementary nets and condition event nets. Both models ....

....of linear logic, but this topic deserves further attention. Connected both to these classes of nets and the notion of process are the concepts of synchronic distance and synchronic structure [19, 13, 12] Finally, it would be interesting to consider the concept of compositionality of Petri nets [5, 14] from the point of view of linear logic. ....

L. Bernardinello, F. de Cindio: "A Survey of Basic Net Models and Modular Net Classes", in ??, pp 304--351.

....nets. Other versions of 1 safe nets can be found in the literature, namely the Condition Event systems [33] and the Elementary Net Systems [36] This multiplicity of definitions is maybe annoying but harmless: the di#erences among them are small, and of rather technical nature (see [1] for a discussion) In particular, our results are independent of the definition used. 2 Definitions We recall in this section some basic concepts about Place Transition nets and 1 safe nets, and define the reachability, liveness and deadlock problems. A Place Transition net, or just a net, is a ....

Luca Bernardinello and Fiorella De Cindio. A survey of basic net models and modular net classes. In Aduances in Petri Nets 1992, pages 304-351. Springer-Verlag (LNCS 609), 1992.

....respecting net morphisms ( 3] Modularisation can be viewed as a horizontal development technique . Several system entities are identified and separately modeled. These modules are then interrelated as to constitute one overall system model. This can be realised by net composition mechanisms ([1]) Combining abstraction and modularisation would yield an interesting net development technique which, to our knowledge, has not explicitly been researched yet. Another method for modelling concurrent systems is statecharts. It is based on state diagrams, where depth is introduced by refining ....

L. Bernardinello and F. De Cindio. A Survey of Basic Net Models and Modular Net Classes. In Advances in Petri Nets '92, pages 304--351, 1992.

....nets. Other versions of 1 safe nets can be found in the literature, namely the Condition Event systems [30] and the Elementary Net Systems [33] This multiplicity of definitions is maybe annoying but harmless: the differences among them are small, and of rather technical nature (see [1] for a discussion) In particular, our results are independent of the definition used. 2 Definitions We recall in this section some basic concepts about Place Transition nets and 1 safe nets, and define the reachability, liveness and deadlock problems. A Place Transition net, or just a net, is ....

Luca Bernardinello and Fiorella De Cindio. A survey of basic net models and modular net classes. In Advances in Petri Nets 1992, pages 304--351. Springer-Verlag (LNCS 609), 1992.

....and composition mechanisms in Petri nets is still a major weakness [12] Various forms of graphical folding mechanisms [7] 18] have been proposed but only aid in information hiding and not in the composition of nets. Modularization including composition proposals include those described in [2], 10] which also presents module refinement techniques) and Hierarchical Colored Petri Nets [13] Recently there have been attempts to combine the structuring techniques of object oriented programming with Petri nets [6] 14] 23] Allowing behavior to be described with a Petri net enables ....

Bernardinello L., De Cindio F., A Survey of Basic Net Models and Modular Net Classes, LNCS

....not be viewed as a means to statically interconnect the nets of different agents of the system. But synchronization specifications are rather a means to formally denote the interdependency of 1 For an overview of this and other techniques for modular net construction, the reader is referred to [1]. consume produce deliver get Figure 3: One net modelling the overall system of a specific configuration. agent activity in terms of their types and state. 3 Generic Nets A large variety of Petri nets exist. Each sort probably has certain characteristics (e.g. the grain size of the ....

L. Bernardinello and F. De Cindio. A Survey of Basic Net Models and Modular Net Classes. In Advances in Petri Nets '92, pages 304--351, 1992.

....and composition mechanisms in Petri nets is still a major weakness [13] Various forms of graphical folding mechanisms [7] 21] have been proposed but they only aid in information hiding and not in the composition of nets. Modularization including composition proposals include those described in [2], 10] which also presents module refinement techniques) and Hierarchical Colored Petri Nets [14] Recently there have been attempts to combine the structuring techniques of object oriented programming with Petri nets [6] 15] 26] Allowing behavior to be described with a Petri net enables ....

Bernardinello L., De Cindio F., A Survey of Basic Net Models and Modular Net Classes, LNCS 1 609, Springer Verlag 1992

No context found.

Bernardinello, L., Cindio, F.D.: A survey of basic net models and modular net classes. In Rozenberg, G., ed.: Advances in Petri Nets: The DEMON Project. Volume 609 of Lecture Notes in Computer Science. Springer-Verlag (1992) 304-- 351

No context found.

Bernardinello, L., De Chindio, F.: A survey of basic net models and modular net classes. G. Rozenberg, ed., Advances in Petri nets

No context found.

Bernardinello, L., De Chindio, F.: A survey of basic net models and modular net classes. G. Rozenberg, ed., Advances in Petri nets 1992, Lecture Notes in Computer Science 609, (Springer, Berlin, 1992) 304--351.

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