Please Enter a Search Term
Seminar: Find All Possible Bindings in Colored Petri-nets
Paul Price
Sadegh Ekrami

M.Sc. Candidate

Supervisor: Dr. Wlodek Zuberek



Department of Computer Science

Wednesday, October 3, 2012, 12:00 p.m., Room EN 2022





Abstract



Formal models are considered as an intermediate stage between the design and

implementation phase of a system.  They are useful for simulating, testing,

modeling and demonstrating system’s behavior in micro and macro scale. 

Petri-nets are one of the popular formalism which has been proposed by Carl A.

Petri in 1962.  Many improvements have been proposed by modelers and

significant changes have shaped this powerful formalism in a way that presently

many scientists, practitioners and system designers are using for their work. 

Colored Petri-nets (known as CP-nets) is a graphical formalism for design,

specification, simulation and verification of systems.  CP-nets fold an

ordinary Petri-net into simpler one, eliminating similar parts of the model. 

Petri nets are in particular well-suited for systems in which communication,

synchronisation and resource sharing are important.  In this proposal, a new

approach to finding all possible bindings for CP-nets is being outlined.
Oct 2nd, 2012

Bookmark and Share

Share