Seminar: Bindings in Colored Petri-Nets

Sadegh Ekrami
M.Sc. Candidate
Supervisor: Dr. Wlodek Zuberek

Bindings in Colored Petri-Nets

Department of Computer Science
Wednesday, April 23, 2014, 2:00 p.m., Room EN 2022


Performance analysis of systems is an important part of system evaluation. A popular approach to performance analysis first develops a model of the system, and then uses this model to analyze the performance (and possibly other properties) of the system. Colored Petri nets (known as CPNs) are powerful graphical formalism designed for simple representation of concurrency and resource sharing. One of the challenging issues in CPNs is to find bindings, i.e. mapping of free variables used in all expressions to specific colors. Bindings are needed to determine next states of a system,
therefore, are needed in analysis of system’s behavior. A heuristic approach is proposed which enhances the efficiency of finding bindings in CPNs. Also, a performance analysis is used on some approaches and the proposed approach and some remarkable improvement is achieved through the