Improved parallel composition of labelled Petri nets

  1. Lookup NU author(s)
  2. Arseniy Alekseyev
  3. Dr Victor Khomenko
  4. Dr Andrey Mokhov
  5. Dominic Wist
  6. Professor Alex Yakovlev
Author(s)Yakovlev A; Khomenko V; Mokhov A; Wist D; Alekseyev A
Editor(s)Caillaud, B., Carmona, J.
Publication type Conference Proceedings (inc. Abstract)
Conference Name11th International Conference on Application of Concurrency to System Design (ACSD)
Conference LocationKanazawa, Japan
Year of Conference2011
Source Publication Date20-24 June 2011
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Parallel composition of labelled Petri nets is a fundamental operation in modular design. It is often used to combine models of subsystems into a model of the whole system. Unfortunately, the standard definition of parallel composition almost always yields a ‘messy’ Petri net, with many implicit places, causing performance deterioration in tools that are based on structural methods. In this paper we propose an optimised algorithm for computing the parallel composition. It often produces nets with fewer implicit places, which are thus better suited for subsequent application of structural methods.