Coloured Petri Nets and the Invariant Method

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • Department of Computer Science
In many systems a number of different processes have a similar structure and behaviour. To shorten system description and system analysis it is desirable to be able to treat such similar processes in a uniform and succinct way. In this paper it is shown how Petri nets can be generalized to allow processes to be described by a common subnet, without losing the ability to distinguish between them. Our generalization, called coloured Petri nets, is heavily influenced by predicate transition-nets introduced by H.J. Genrich and K. Lautenbach. Moreover our paper shows how the invariant-method, introduced for Petri nets by K. Lautenbach, can be generalized to coloured Petri nets.
Original languageEnglish
JournalTheoretical Computer Science
Volume14
Issue3
Pages (from-to)317-336
Number of pages19
ISSN0304-3975
DOIs
Publication statusPublished - 1981

See relations at Aarhus University Citationformats

ID: 18142035