Show simple item record

dc.contributor.authorMacDonell, Stephen Gerard
dc.contributor.authorBenwell, GL
dc.date.accessioned2012-05-17T08:51:42Z
dc.date.available2012-05-17T08:51:42Z
dc.date.copyright1994
dc.date.issued2012-05-17
dc.identifier.citationAustralian Journal of Information Systems, vol.2(1), pp.17 - 28
dc.identifier.urihttp://hdl.handle.net/10292/4196
dc.description.abstractPetri 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 Pctri nets.
dc.publisherAustralian Computer Society Digital Library
dc.relation.urihttp://dl.acs.org.au/index.php/ajis/article/view/412
dc.rightsThis journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge.
dc.titleAssessing the graphical and algorithmic structure of hierarchical coloured Petri net models
dc.typeJournal Article
dc.rights.accessrightsOpenAccess
dark.contributor.authorBenwell, GL
dark.contributor.authorMacDonell, SG
aut.relation.endpage28
aut.relation.issue1
aut.relation.startpage17
aut.relation.volume2


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record