Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/87302
Title: Representing petri net structures as directed graphs
Other Titles: Recent researches in software engineering, parallel and distributed systems
Authors: Spiteri Staines, Tony
Keywords: Petri nets
Directed graphs
Program transformation (Computer programming)
Issue Date: 2011
Publisher: World Scientific and Engineering Academy and Society (WSEAS)
Citation: Spiteri Staines, A. (2011). Representing petri net structures as directed graphs. In Z. Bojkovic, J. Kacprzyk, N. Mastorakis, V. Mladenov, & R. Revetria (Eds.), Recent researches in software engineering, parallel and distributed systems (pp. 30-35). Athens: World Scientific and Engineering Academy and Society (WSEAS).
Abstract: This paper attempts to explain some basic properties about Petri nets and their relation to directed graphs that can be formal or informal. The related works justifies the reasoning how and why Petri nets are obtained or supported using graphs. The main problem tackled is how graphs can be obtained from Petri nets. Possible solutions that use reduction methods to simplify the Petri net are presented. Different methods to extract graphs from the basic or fundamental Petri net classes are explained. Some examples are given and the findings are briefly discussed.
URI: https://www.um.edu.mt/library/oar/handle/123456789/87302
ISBN: 978-960-474-277-6
Appears in Collections:Scholarly Works - FacICTCIS

Files in This Item:
File Description SizeFormat 
Representing_petri_net_structures_as_directed_graphs.pdf
  Restricted Access
422.62 kBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.