Hartmann J Genrich. Predicate/Transition nets. In Wilfried Brauer, Wolfgang Reisig, and Grzegorz Rozenberg, editors, Petri Nets: Applications and Relationships to Other Models of Concurrency, Part I, volume 254 of Lecture Notes in Computer Science, pages 207-247. Springer-Verlag, Berlin, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in Maria (which was not implemented at that time) The concrete analysis also brought some changes to the model. In this paper, however, we present the DDCA (Distributed Dynamic Channel Allocation) algorithm [PSS95] using high level Petri Nets, speci cally Pr T (Predicate Transition) nets [Gen87]. Inhibitor arcs are used as a shorthand notation in the model which is general, non tool speci c, allowing for analysis using any high level Petri net tool. The net model used in the analysis, however, contains no inhibitor arcs. Section 2 presents the DDCA algorithm in general and Section 3 the ....

Hartmann J Genrich. Predicate/Transition nets. In Wilfried Brauer, Wolfgang Reisig, and Grzegorz Rozenberg, editors, Petri Nets: Applications and Relationships to Other Models of Concurrency, Part I, volume 254 of Lecture Notes in Computer Science, pages 207-247. Springer-Verlag, Berlin, 1987.

....theory of concurrency and as a formal specification technique for distributed and concurrent systems. High level nets can be considered as the integration of process and data type description. Some of the most prominent classes are Coloured Petri Nets [Jen92,Jen94,Jen97] Predicate Transition nets [GL81,Gen91] and algebraic high level nets [Vau87,Rei91,PER95] Coloured Petri Nets are the focus of this paper, since they are widely known and constitute a very popular class of highlevel Petri nets. The practical relevance of Coloured Petri Nets is considered to be very high, not at least due to the ....

H.J. Genrich. Predicate/Transition Nets. In High-Level Petri Nets: Theory and Application, pages 3--43. Springer Verlag, 1991.

....net on the left hand side. 5 shark.hungry herring eating shark.full 5 shark.hungry herring eating shark.full Figure 1: A simple Petri net before and after the transition occurrence Furthermore, we are using the possibility to define tokens that have got attributes for their distinction (Genrich 1987, Jensen 1990) Naturally, the enabling condition of a transition may now depend on the attributes of the tokens that will be consumed from the places in the transition s preset. The transition rules can be given in a formal manner as in predicate transition nets (Genrich 1987) by formulas of ....

....for their distinction (Genrich 1987, Jensen 1990) Naturally, the enabling condition of a transition may now depend on the attributes of the tokens that will be consumed from the places in the transition s preset. The transition rules can be given in a formal manner as in predicate transition nets (Genrich 1987) by formulas of first order logic. For reasons of simplicity, we use pseudo code for transition rules throughout this paper. Fig. 2 shows a net where the place shark.existence.state represents an area that can contain a token shark with two different attributes. The attribute existence can be of ....

Genrich, H.J. 1987. Predicate/Transition Nets. In Petri Nets: Central Models and Their Properties, W. Brauer et al., eds. LNCS 254, Springer Verlag, 207-247.

....of a selection of practical applications of coloured Petri nets is provided by Jensen [65] The literature on modelling and analyzing railway systems using Petri nets and CPNs is not extensive. The idea of applying Petri net theory to the modelling of railway systems goes back at least to Genrich [41], who modelled the operation of two trains traveling in the same direction on a circular track of seven sections to introduce the concepts of Predicate Transition nets [41] The safety requirement, stated by Genrich, was that any two trains must be separated by at least one empty section of the ....

....CPNs is not extensive. The idea of applying Petri net theory to the modelling of railway systems goes back at least to Genrich [41] who modelled the operation of two trains traveling in the same direction on a circular track of seven sections to introduce the concepts of Predicate Transition nets [41]. The safety requirement, stated by Genrich, was that any two trains must be separated by at least one empty section of the track. Around the same time, a railway crossing gate was modelled and analyzed using Petri nets [73] Genrich s train example was revisited in [10] where the number of ....

[Article contains additional citation context not shown here]

H. J. Genrich. Predicate/Transition nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Advances in Petri Nets, Petri Nets: Central Models and Their Properties. Lecture Notes in Computer Science, vols. 254 and 255, Springer Verlag, 1987.

....of places and transitions of a CE net (a) to PrT net (d) x is a free variable that may take any term as its value (in this case either a or c . It is also called the index of the expression. The symbol denotes a non negative linear combination. Definition 2. 3:Strict PrT nets [2] Let L be a first order language and let L s designate the sublanguage using only # s , the predicates denoting static relations. The class PRT L consists of marked annotated nets, MN= N, A, M 0 ) where N is the underlying directed net, A is its annotation in L, and M 0 is its ....

....of tuples of constants such that if n is the index of the predicate annotating s, then M 0 (s) is in LC (n) and the value of M 0 (s) R(M 0 (s) is a linear combination with coe#cients being either 0 or 1, i.e. it is the characteristic function of the set. For a more depth in view, see [2]. Example 1. Let us consider the following hospital case: Patients arriving to the hospital first aid center needs treatment. Some of the patients needs attention of more than just one nurse. After first aid some of the patients may leave the hospital, others must stay. We then have the following ....

Hartmann J. Genrich, Predicate/Transition Nets, in Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part I, Proceedings of an Advance Course, Bad Honnef, September 1986, Ed. W.Brauer, W. Reisig and G. Rosenberg, in the series Lecture Notes in Computer Science, Ed. G. Goos and J. Hartmanis, Springer Verlag.

.... M . Symmetry respecting hash functions [Schmidt 1999; 2000a; 2000b] can be used to prune the set of markings of Q that need to be checked. 3. Build a canonical representative marking for M and check whether it is in Q. Example 3. 3 Consider the variant of Genrich s railroad system net [Genrich 1991] shown in Fig. 1(a) Its reachability graph is shown in Fig. 1(b) The group Aut(N) is generated by the rotation rot = Ua0 Ua1 Ua2 Ua3 Ua4 Ua5 U b0 U b5 V0 V5 t a0 t a5 t b0 t b5 Ua1 Ua2 Ua3 Ua4 Ua5 Ua0 U b1 U b0 V1 V0 t a1 t a0 t b1 t b0 and the swapping ....

GENRICH, H. J. 1991. Predicate/transition nets. In High-level Petri Nets; Theory and Application, K. Jensen and G. Rozenberg, Eds. Springer-Verlag, 343.

....means for the analysis and veri cation of such systems. High level nets can be considered as the integration of process and data type description. The most prominent classes are Coloured Petri Nets (Jensen, 1992; Jensen, 1994; Jensen, 1997) Predicate Transition nets (Genrich and Lautenbach, 1981; Genrich, 1991) and algebraic highlevel nets (Vautherin, 1987; Reisig, 1991; Padberg et al. 1995) Coloured Petri Nets are the focus of this paper, since they are practical relevant due to the successful tool Design CPN (Jensen et al. 1991) 1 This work is partly founded by the joint research project ....

Genrich, H.J. (1991). Predicate/Transition Nets.

....to AHL nets [PER95, Vau87, Rei91] AHL nets consist of Petri nets for the process description and algebraic specifications [EM85] for the data type description. In general, the integration of data and process information into one formal specification technique leads to high level nets (see e.g. [Jen81, Jen92, GL81, Gen91]) In high level nets, structured tokens are used to represent the data of a system, whereas the Petri net captures the modification of the data. The main advantage of this integration is that it allows a more compact presentation of complex system, i.e. a user friendly presentation. ....

H.J. Genrich. Predicate/Transition Nets. In High-Level Petri Nets: Theory and Application, pages 3--43. Springer Verlag, 1991.

....1996 Abstract Weintroduce an approach for modeling and analyzing software processes. It is based on describing software processes by FUNSOFT nets. FUNSOFT nets are high level Petri nets whichhave been particlularly developed to support software process modeling. Their semantics is de#ned by Predicate#Transition nets. That enables to bene#t from standard analysis techniques approved for Predicate#Transition nets. Finally we discuss how the S invariant analysis method for Predicate#Transition nets helps to reveal properties of software processes described by FUNSOFT nets. Keywords FUNSOFT ....

....on describing software processes by FUNSOFT nets. FUNSOFT nets are high level Petri nets whichhave been particlularly developed to support software process modeling. Their semantics is de#ned by Predicate#Transition nets. That enables to bene#t from standard analysis techniques approved for Predicate#Transition nets. Finally we discuss how the S invariant analysis method for Predicate#Transition nets helps to reveal properties of software processes described by FUNSOFT nets. Keywords FUNSOFT nets, semantics de#nition in terms of Pr#T nets, analysis of FUNSOFT nets, S invariant analysis ....

[Article contains additional citation context not shown here]

Predicate#Transition Nets. In Proceedings of the 5 th International Conferenceon Application and Theory of Petri Nets, 1984.

....make assumptions about the behavior of the environment. Assumptions and commitments may be given by temporal logic formulae. Generally, first order temporal logic is necessary to describe the services of a G Net, as the realization of the methods are given by a modified Predicate Transition Net [8], but we may separate the pure interaction (the protocol) which may be described using only propositional temporal logic, from the proper service specification dealing with the computation of data, where first order logic is necessary. Thus, in most cases, it is possible to separate the ....

H.J. Genrich. Predicate/Transition nets. In W. Brauer, W. Reisig, and G. Rozemberg, editors, Petri Nets: Central Models and Their Properties, volume 254 of Lecture Notes in Computer Science, pages 207--247. Springer-Verlag, 1987.

....distributed, asynchronous, parallel, non deterministic and or stochastic nature [12] High level Petri Nets (HLPN) is an extension class of Petri Nets, which allows the integration of abstract data types theory to the nets theory. Among several HLPN we may cite the PredicateTransition Nets [8] and Coloured Petri Nets (CPN) 10] The use of HLPN to describe distributed information systems simplifies the models due to the inherent concurrent facilities provided and to the powerful expressiveness associated to the net by means of inscriptions, generally written in a formal specification ....

H.J. Genrich. Predicate/Transition nets. In W. Brauer, W. Reisig, and G. Rozemberg, editors, Petri Nets: Central Models and Their Properties, volume 254 of Lecture Notes in Computer Science, pages 207--247. Springer-Verlag, 1987.

....for the general theory of concurrency and as a formal specification technique for distributed and concurrent systems. High level nets can be considered as the integration of process and data type description, most prominent classes are Coloured Petri nets [Jen92, Jen95] Predicate Transition nets [GL81, Gen91] and algebraic high level nets [Vau87, Rei91, PER95] The practical relevance of high level Petri nets is considered to be very high, as there are many high level Petri net tools used in real software production (e.g. LEU [SM97] Design CPN [JCHH91] INCOME [OSS94] Since algebraic ....

H.J. Genrich. Predicate/Transition Nets. In High-Level Petri Nets: Theory and Application, pages 3--43. Springer, 1991.

....nets [9, 41] one can make compact models in a natural way. Fortunately, a high level net can often be unfolded into a behaviourally equivalent finite place transition net, and, using the inverse mapping of the unfolding mapping, the place transition net can be folded back into the high level net [22, 40]. This also provides a path of extending results on place transition nets to high level nets. 1.2 An LTL and associated automata Linear time temporal logics [19] give us a straightforward though of course a limited way to express what should or should not happen in a concurrent or distributed ....

....incremental algorithm The next example shows that it is by no means exaggerated to say that the stubborn sets computed by the incremental algorithm may contain unnecessarily many enabled transitions. Figure 21 presents a data base system of n 2 data base managers. The predicate transition net [22] in the figure is equivalent to the coloured Petri net in [40] The contained resource allocation and a great amount of concurrency makes the system inherently very suitable for the stubborn set method. Let us assume the most obvious unfolding [22] into a place transition net. The image of a ....

[Article contains additional citation context not shown here]

Genrich, H.J.: Predicate/Transition Nets. In [9], pp. 207--247.

....nets one can make compact models in a natural way. Fortunately, a high level net can often be unfolded into a behaviourally equivalent finite place transition net, and, using the inverse mapping of the unfolding mapping, the place transition net can be folded back into the high level net [24, 40]. This provides a path of extending results on place transition nets to high level nets. The application of the stubborn set method and the sleep set method is not limited to Petri nets. The methods have been applied to several models of concurrency by Valmari [75, 79] Godefroid and Pirottin ....

....nets [8, 43] one can make compact models in a natural way. Fortunately, a high level net can often be unfolded into a behaviourally equivalent finite place transition net, and, using the inverse mapping of the unfolding mapping, the place transition net can be folded back into the high level net [24, 40]. If such unfolding exists, one can apply the stubborn set method to the result of the unfolding and then fold the reduced reachability graph. However, even a high level net, the set of reachable markings of which is finite, may be difficult to unfold since the unfolding procedure usually needs ....

[Article contains additional citation context not shown here]

Genrich, H.J.: Predicate/Transition Nets. In [8], pp. 207--247.

....an approach for the distribution of workflows based on the fragmentation of high level Petri nets such as predicate transition nets. Data fragmentation and replication concepts for relational databases are modified and extended to process fragmentation and replication. Predicate transition nets [6] provide a natural extension for the relational data model concerning the dynamic behavior of the relations. They combine the graphical workflow representation and a formal foundation [1, 5, 9] Hence, the Petri net model can be directly executed by a workflow management system. In the next ....

....nets [2, 11] combine the advantages of the graphical representation of processes with a formal definition. This allows on the one hand the analysis and validation [4] of business processes and on the other hand the visualization of processes. High level Petri nets such as predicate transition nets [6, 9] integrate behavior and object related aspects of workflows. A predicate transition net (PrT net) is a Petri net where the places (predicates) represent relation schemes. The marking of the net assigns to each place a relation according to the respective relation scheme. A transition represents a ....

GENRICH, H.J., Predicate/Transition Nets, in [2], pp. 207-247.

....A. Junttila Finding Symmetries of Algebraic System Nets the state space LTS G, or formally, there is a group homomorphism f : Sym(G) 1 2.1. An Example To make things more concrete, consider the nets in Fig. 1. They all model the same railway system and are 6 placed variants of the nets in [9]. Let us rst examine the symmetries present on the system description level, i.e. in the Petri nets. The structure of the Place Transition net in Fig. 1(a) is symmetric in two respects: i) The trains a and b (the U places) access the track sections (the V places) in the same way, independent of ....

H. J. Genrich. Predicate/transition nets. In Jensen and Rozenberg [20], pages 3-43.

....phase of software engineering, making use of object oriented paradigms and Petri nets. Because there do exist a couple of good object oriented approaches on data modeling, we do not introduce a new one. Object models as proposed by Rumbaugh et al. [30] are integrated into special kinds of prt nets [17], used for functional and dynamic modeling. We give a short introduction of our design method, and present different types of Petri nets and their use for conceptual modeling. Most approaches do not offer deep advice for transforming the conceptual model into a software product, whereas our models ....

....on content or author; they might never be retrieved again. These more general properties of system dynamics are visualized by Petri nets, presented in the Section four. 3. 2 Predicate transition nets Predicate transition nets (prt nets) for being a high level Petri net model, were introduced by [18, 17] to model concurrent systems; as seen in [16, 18] prt nets are suitable for system modeling in general. The advantage compared to other formalisms is that prt nets are well founded and hereby support different kinds of analysis. Prt nets are in the center of our modeling approach. In order to make ....

H.J. Genrich, Predicate/Transition Nets, In: High-Level Petri Nets Theory and Application, Ed. K. Jensen and G. Rozenberg, Springer Verlag, 1991.

....is, to allow individual objects as tokens. With this extension, we can model the common component only once and assign one distinguishable token to each identical component. This development leads to a class of Petri Nets called highlevel Petri Nets, including Predicate Transition nets (PrT nets) [10, 9] Colored Petri Nets (CP Nets) 12] Relation Nets (Rel Nets) 17] and Petri Nets with Individual Tokens [18] However, even with high level Petri nets, system modeling can still be difficult because no mechanisms or notations are provided in these Also with Departamento de Engenharia ....

H.J. Genrich. Predicate/Transition Nets. In W. Brauer, W. Reisig, and G. Rozemberg, editors, Lecture Notes in Computer Science, Petri Nets: Central Models and Their Properties, volume 254, pages 207--247. Springer Verlag, 1987.

....out the focus of our future research on FUNSOFT net analysis and application of FUNSOFT net analysis facilities. 2 An Introduction to FUNSOFT Nets The basic motivation for developing FUNSOFT nets was the finding that high level Petri nets, such as coloured Petri nets [Jen83, Jen87] and Pr T nets [Gen87] provide analysis facilities that are worth exploiting in software process model analysis. However, none of these Petri net types fulfills all the key requirements for software process modeling languages such as integration of software development tools, modeling of complex object types, or ....

H.J. Genrich. Predicate/Transition Nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Applications and Relationships to other Models of Concurrency, Berlin, FRG, 1987. Springer. Appeared in Lecture Notes on Computer Science 254.

.... to each other by virtue of the fact that they are all activities which follow the dictated behaviour ( 16] An accepted method to assign meaning to activity models is to use some variant of Petri nets as underlying operational model ( 4] 22] Well known variants are Predicate Transition nets ([9] and [26] and PT nets ( 2] The semantics of the dynamic behaviour of activity models then is described as a mapping from activity models into the underlying operational model. We illustrate this by an example taken from [4] In this paper, PTnets are used as underlying operational model. The ....

H. Genrich. Predicate/transition nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and their Properties, pages 207--247. Springer Verlag, 1987.

....objects (in the object oriented sense) instead of simple tokens (as in regular Petri nets) in the reachability of places. Such a simple example does not require the most advanced features PNOs, so the net modelling it can therefore be read and interpreted as a conventional predicate transition net [10]. A net models the potential evolution of the dialogue in the following way: any user action is associated with one or several transitions in the net (the name of the action is inscribed inside each transition) An action may be triggered if at least one of its associated transitions is enabled ....

H.J. Genrich, Predicate/transition nets, in W. Brauer, W. Reisig and G. Rosenberg, eds., Petri nets: applications and relationships to other models of concurrency, Lecture Notes in Computer Science 254 & 255, SpringerVerlag, Berlin, 207-247.

....structure diagrams, which are intended for graphically representing complex process specifications. The semantics of these task structure diagrams have been defined by means of a translation to Process Algebra. Compared to the formalisation of task structure diagrams in Predicate Transition nets ([11]) as documented in [2] this definition is more compact and comprehensible. Furthermore, it allows to prove equivalence between task structures using techniques developed for Process Algebra. This equivalence can be used to prove that two seemingly different ways of working are equal. It also ....

H. Genrich. Predicate/Transition Nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986 Part I, volume 254 of Lecture Notes in Computer Science, pages 207--247. SpringerVerlag,

....previously investigated. In (Sami and Vidal Naquet, 1991) an equivalence between actors and the formalism of CPN (Jensen, 1992) is provided with the goal of formalising actor semantics. The work of Agha et al. described in (Agha et al. 1992) is concerned with the use of Predicate Transition nets (Genrich, 1987) in order to support the visualisation of actor programs. Predicate Transition nets (PrT nets) and CPN are formally equivalent and can be considered as two slightly different dialects of the same language. But none of these approaches has analysis aims. Moreover, only functional aspects are ....

Genrich H. J. (1987). Predicate/transition nets. In Advances in Petri Nets, W. Brauer, W. Reisig and G. Rozenberg (eds.), New York, Springer Verlag.

No context found.

, Advances in Advances in Advances in Advances in Petri Nets 1986, Part I Petri Nets 1986, Part I Petri Nets 1986, Part I Petri Nets 1986, Part I, Berlin: Springer-Verlag, pp. 207-247. Hale, K. & Keyser, S. J. 21 2121 21

No context found.

H.J. Genrich. Predicate/transition nets. In Petri Nets: Central Models and Their Properties. W. Brauer, W. Resig and G. Rozenberg (eds), LNCS 254. 1987, 207-247.

First 50 documents

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