Extensions to coloured Petri nets

Billington, Jonathan

doi:10.1109/pnpm.1989.68540

Cited by 13 publications

(23 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The discussion of place capacities and inhibitor arcs is based on work presented in [Bil88]. We show how the work presented in [Bil88] can be generalised and improved to overcome a number of the problems noted there.…”

Section: Introductionmentioning

confidence: 99%

“…We show how the work presented in [Bil88] can be generalised and improved to overcome a number of the problems noted there.…”

Section: Introductionmentioning

confidence: 99%

“…The approach is based on ideas originating from Kurt Jensen and briefly mentioned in [Bil88]. First we informally describe the generalised place capacity concept.…”

Section: Informal Introduction To Place Capacitiesmentioning

confidence: 99%

“…The colour set of p is the product of two colour sets, U and V. The place capacity of p is specified as the triple: (U, Proj1, 2*U), where U is the capacity colour set, Proj1 is the capacity projection mapping pairs onto their first component and 2*U is the capacity multi-set consisting of 2 elements of each colour in U. In the following we show how three earlier proposed capacity concepts: integer capacity, multi-set capacity and multi-set capacity with unbounded colours [Bil88], can be expressed in terms of our general capacity concept.…”

Section: Informal Introduction To Place Capacitiesmentioning

confidence: 99%

See 3 more Smart Citations

Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs

Christensen¹,

Hansen²

1992

DPB

View full text Add to dashboard Cite

In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives-place capacities, test arcs and inhibitor arcs. The new modelling primitives are introduced to improve the possibilities of creating models that are on the one hand compact and comprehensive and on the other hand easy to develop, understand and analyse. A number of different place capacity and inhibitor concepts have been suggested earlier, e.g., integer and multi-set capacities and zero-testing and threshold inhibitors. These concepts can all be described as special cases of the more general place capacity and inhibitor concepts defined in this paper. We give an informal description of the new concepts and show how the concepts can be formally defined and integrated in the Petri net framework-keeping the basic properties of CP-nets. In contrast to a number of the previously suggested extensions to CP-nets the new modelling primitives preserve the concurrency properties of CP-nets. We show how CP-nets with place capacities, test arcs and inhibitor arcs can be transformed into behaviourally equivalent CP-nets without these primitives. From this we conclude that the basic properties of CP-nets are preserved and that the theory developed for CP-nets can be applied to the extended CP-nets. This means that, e.g., the generalisations of analysis methods of CP-nets to cover the new modelling primitives are straightforward.The reader is assumed to be familiar with the notion of CP-nets.

show abstract

Section: Introductionmentioning

confidence: 99%

“…We show how the work presented in [Bil88] can be generalised and improved to overcome a number of the problems noted there.…”

Section: Introductionmentioning

confidence: 99%

“…The approach is based on ideas originating from Kurt Jensen and briefly mentioned in [Bil88]. First we informally describe the generalised place capacity concept.…”

Section: Informal Introduction To Place Capacitiesmentioning

confidence: 99%

Section: Informal Introduction To Place Capacitiesmentioning

confidence: 99%

See 2 more Smart Citations

Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs

Christensen¹,

Hansen²

1992

DPB

View full text Add to dashboard Cite

show abstract

“…The one in which it is possible to execute is called there the semantics, and that in which is disallowed is called the semantics. In this paper we will interpret all inhibitor arcs using the former semantics; examples of other work on nets with inhibitor arcs include [5,10,17]. TSENI transition systems are essentially a subset of general of [18] as their arcs are labelled by sets of events rather than by single events (see Figure 1(b)); examples of other work on transition system models include [1, 4,14,16,19].…”

mentioning

confidence: 99%

Synthesis of ENI-systems using minimal regions

Pietkiewicz-Koutny

1998

CONCUR'98 Concurrency Theory

View full text Add to dashboard Cite

We consider the synthesis problem for Elementary Net Systems with Inhibitor Arcs (ENI-systems) executed according to the semantics. The relationship between nets and transition systems generated by them (TSENI) is established via the notion of a . The general synthesis problem for ENI-systems was solved in [20], and here we show how to optimise this solution using only minimal regions and selected inhibitor arcs. We also compare the proposed method of eliminating inhibitor arcs in ENI-systems with that introduced in [8] and show that they are similar..

show abstract