The complexity of Petri Net transformations

dc.contributor.author	Donaldson, SR
dc.contributor.author	Bause, F
dc.contributor.author	Kritzinger, Pieter S.
dc.date.accessioned	2018-05-31T13:32:04Z
dc.date.available	2018-05-31T13:32:04Z
dc.date.issued	1996
dc.identifier.citation	Donaldson SR, Bause F & Kritzinger PS (1996) The complexity of Petri Net transformations. South African Computer Journal, Number 18, 1996	en
dc.identifier.issn	2313-7835
dc.identifier.uri	http://hdl.handle.net/10500/24217
dc.description.abstract	We consider the complexity of several property preserving Petri net transformations found in the literature. These transformations were candidates for.inclusion in a software tool to peiform liveness and boundedness analysis on Petri nets. These results show that it is infeasible for certain transformations in general to assist in liveness and boundedness analysis. We also consider synthesis transformations and show, for each transformation, their complexities. In each case, we consider the complexity of the decision problem with regard to the applicability of the transformation. .	en
dc.language.iso	en	en
dc.publisher	South African Computer Society (SAICSIT)	en
dc.subject	Petri Nets	en
dc.subject	Analysis of Algorithms	en
dc.subject	Problem complexity	en
dc.subject	Program verification	en
dc.subject	Model validation and analysis	en
dc.subject	Model development	en
dc.subject	Reduction and synthesis transformations	en
dc.subject	Liveness	en
dc.subject	Boundedness	en
dc.title	The complexity of Petri Net transformations	en
dc.type	Article	en