Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

The complexity of Petri net transformations

Bibliography: pages 124-127.

Saved in:
Bibliographic Details
Main Author: Donaldson, Stephen Richard
Other Authors: Kritzinger, Pieter S
Format: Thesis
Language:English
Published: Department of Computer Science 2015
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867613142027075584
access_status_str Open Access
author Donaldson, Stephen Richard
author2 Kritzinger, Pieter S
author_browse Donaldson, Stephen Richard
Kritzinger, Pieter S
author_facet Kritzinger, Pieter S
Donaldson, Stephen Richard
author_sort Donaldson, Stephen Richard
collection Thesis
description Bibliography: pages 124-127.
format Thesis
id oai:open.uct.ac.za:11427/16009
institution University of Cape Town (South Africa)
language eng
last_indexed 2026-06-10T12:31:26.417Z
license_str Not specified — see source repository
provenance_str_mv Harvested via OAI-PMH from UCTD — University of Cape Town Open Access Repository
publishDate 2015
publishDateRange 2015
publishDateSort 2015
publisher Department of Computer Science
publisherStr Department of Computer Science
record_format dspace
source_str UCTD — University of Cape Town Open Access Repository
spelling oai:open.uct.ac.za:11427/16009 The complexity of Petri net transformations Donaldson, Stephen Richard Kritzinger, Pieter S Computer Science Bibliography: pages 124-127. This study investigates the complexity of various reduction and synthesis Petri net transformations. Transformations that preserve liveness and boundedness are considered. Liveness and boundedness are possibly the two most important properties in the analysis of Petri nets. Unfortunately, although decidable, determining such properties is intractable in the general Petri net. The thesis shows that the complexity of these properties imposes limitations on the power of any reduction transformations to solve the problems of liveness and boundedness. Reduction transformations and synthesis transformations from the literature are analysed from an algorithmic point of view and their complexity established. Many problems regarding the applicability of the transformations are shown to be intractable. For reduction transformations this confirms the limitations of such transformations on the general Petri net. The thesis suggests that synthesis transformations may enjoy better success than reduction transformations, and because of problems establishing suitable goals, synthesis transformations are best suited to interactive environments. The complexity of complete reducibility, by reduction transformation, of certain classes of Petri nets, as proposed in the literature, is also investigated in this thesis. It is concluded that these transformations are tractable and that reduction transformation theory can provide insight into the analysis of liveness and boundedness problems, particularly in subclasses of Petri nets. 2015-12-28T06:11:39Z 2015-12-28T06:11:39Z 1993 Master Thesis Masters MSc http://hdl.handle.net/11427/16009 eng application/pdf Department of Computer Science Faculty of Science University of Cape Town
spellingShingle Computer Science
Donaldson, Stephen Richard
The complexity of Petri net transformations
thesis_degree_str Master's
title The complexity of Petri net transformations
title_full The complexity of Petri net transformations
title_fullStr The complexity of Petri net transformations
title_full_unstemmed The complexity of Petri net transformations
title_short The complexity of Petri net transformations
title_sort complexity of petri net transformations
topic Computer Science
url http://hdl.handle.net/11427/16009
work_keys_str_mv AT donaldsonstephenrichard thecomplexityofpetrinettransformations
AT donaldsonstephenrichard complexityofpetrinettransformations