Assessing the Graphical and Algorithmic Structure of Hierarchical Coloured Petri Net Models

Authors

• George Benwell, University of Otago, Dunedin, New ZealandFollow
• Stephen MacDonell, University of Otago, Dunedin, New ZealandFollow

Document Type

Research Article

Abstract

Petri nets, as a modelling formalism, are utilised for the analysis of processes, whether for explicit understanding, database design or business process re-engineering. The formalism, however, can be represented on a virtual continuum from highly graphical to largely algorithmic. The use and understanding of the formalism will, in part, therefore depend on the resultant complexity and power of the representation and, on the graphical or algorithmic preference of the user. This paper develops a metric which will indicate the graphical or algorithmic tendency of hierarchical coloured Petri nets.

Recommended Citation

Benwell, George and MacDonell, Stephen (1994) "Assessing the Graphical and Algorithmic Structure of Hierarchical Coloured Petri Net Models," The Australasian Journal of Information Systems: Vol. 2: No. 1, Article 3.
DOI: 10.3127/ajis.v2i1.412
Available at: https://aisel.aisnet.org/ajis/vol2/iss1/3