*For the most recent entries see the
Petri Nets Newsletter.*

## Protocol Specification Using P-Graphs, a Technique Based on Coloured Petri Nets.

Billington, J.
In:
Reisig, W.; Rozenberg, G.: *Lecture Notes in Computer Science, Vol. 1492: Lectures on Petri Nets II: Applications*, pages 293-330.
Springer-Verlag,
1998.
ISBN: 3-540-65307-4.

Abstract:
P-Graphs combine inhibitors Petri nets and abstract data types within the
same algebraic framework. They are useful for the specification of
concrete concurrent systems and in particular communication protocols. The
inhibitor has been included to allow compact descriptions of systems by
promoting the economy of data types. They are also necessary for the
purging of resources; a common activity when modelling protocols or their
services. This paper introduces P-Graphs with the aid of some simple
examples. It also shows how to map P-Graphs to P-nets, which are Coloured
Petri Nets (CP-nets) extended with place capacities and inhibitors. This
is important for the analysis of P-Graph specifications, as P-nets can be
transformed to CP-nets in almost all practical situations. Thus the
analysis techniques of CP-nets can then be applied. Useful notation for
capacities are introduced and their semantics defined in terms of the
P-Graph. A notation for purging places of the tokens is also introduced,
involving the superimposition of the inhibitor and normal arc. Two case
studies, the Demon game and the M-Access Service of the Cambridge Fast
Ring, are included to illustrate the use of the P-Graph and the extended
notation for protocol specification.

*Do you need a refined search? Try our search engine
which allows complex field-based queries.*
*Back to the Petri Nets Bibliography*