Bindings in colored petri nets

Ekrami, Sadegh (2014) Bindings in colored petri nets. Masters thesis, Memorial University of Newfoundland.

[img] [English] PDF - Accepted Version
Available under License - The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission.

Download (742kB)


Performance analysis of systems is an important part of system evaluation. If the analyzed system exists, performance analysis can be based on system's measurements (using some sort of instrumentation). If the analyzed system does not exist (as is the case of system upgrading, improvement or design), the approach is to build a (mathematical) model of the system and to use this model for performance analysis. For systems exhibiting concurrency, resource sharing or synchronization of activities, Petri nets are very often used as the modeling formalism. In colored Petri nets, one of nontrivial tasks is to find bindings, i.e. mapping of free variables used in arc expressions to specific colors. Bindings are needed to determine state transitions of a system, therefore, are needed in all analyses of system's behavior. A heuristic approach is proposed which enhances the efficiency of finding bindings in colored Petri nets. Also, performance analysis is used to compare the proposed approach with some other approaches to finding bindings and some remarkable improvements are shown through this analysis.

Item Type: Thesis (Masters)
Item ID: 8272
Additional Information: Includes bibliographical references (pages 43-47).
Department(s): Science, Faculty of > Computer Science
Date: August 2014
Date Type: Submission
Library of Congress Subject Heading: High performance computing--Mathematical models; Petri nets; Graph algorithms; Graph theory--Data processing

Actions (login required)

View Item View Item


Downloads per month over the past year

View more statistics