Titlebook: High-level Petri Nets; Theory and Applicati Kurt Jensen,Grzegorz Rozenberg Book 1991 Springer-Verlag Berlin Heidelberg 1991 Datentyp (EDV).

策略

Predicate / Transition Nets techniques of modelling static systems as structured sets of individuals (relational structures). These structures are ‘dynamised’ by allowing some relations between individuals to be changed by the processes of the modelled system.

FRET

無孔

Many-sorted High-level Netsce capacities. Many-sorted signatures are used to define inscriptions. MHLNs are defined at two different levels of abstraction. At an abstract level markings and capacities are defined by terms. This is suitable for specifying classes of systems. At the concrete level, a many-sorted algebra satisfy

Mendacious

Petri Nets and Algebraic Specificationspresenting dynamically changing items as structured tokens (instead of “black dots”). Algebraic specifications turned out adequate for dealing with structured items. We will use this formalism to construct Petri nets with structured tokens. Place- and transition-invariants are useful analysis techni

mosque

毗鄰

OBJSA Nets: A Class of High-level Nets Having Objects as Domainsnt system modelling. A promising approach is that of combining nets with algebraic specification techniques. This results in a formal specification language which supports both aspects of system modelling, namely data structure and control structure modelling, with suitable abstraction notions..Some

dominant

Hierarchies in Coloured Petri Netsalyst to structure large CP-nets as a set of interrelated subnets (called pages). The paper discusses the properties of the proposed hierarchy constructs, and it illustrates them by means of two examples. The hierarchy constructs can be used for theoretical considerations, but their main use is to d

烤架

緯度

Generalized Inverses and the Calculation of Symbolic Invariants for Coloured Petri Netsiderable which leads to large sets of reachable markings. To analyse coloured Nets, the method of linear invariants of markings has been used successfully. In this paper, we present a systematic method for calculating symbolic invariants of a coloured Petri Net that is to say, invariant relations in

Aromatic