Composability verification of complex systems using colored petri nets

A Colored Petri Net is a graphical language for construction models of concurrent systems and analyzing their properties. Component is defined in terms of recurring problems in certain domain providing generalized solution for that problem in modeling. It will help the developer to reuse existing model according to their requirement as it can reduce the development cost and time.

Composability can be understood as a capability to select and merge various components in order to fulfill user requirement. Composability provides mean to achieve reusability. “Reuse” basically is the ability of simulation component to be reused for various applications. We propose reusability of patterns and verifying relationships between patterns and also easy navigation using Colored Petri Nets pattern language. Verification is required in order to achieve successful Composability.

Verification is defined in term of a process that can check the model implementation accurately according to the specification. We use verification technique named as “state space analysis” to check the system property and verify the models fulfill the requirement. Basically it can calculate all the reachable states and state changes. These state changes of the system are represented as a directed graph.

The main goal is to provide a component library that will help the developer in making models of concurrent systems. Developers must have domain knowledge in order to find the pattern in solution catalog. Developer doesn’t need to build a model from the scratch. It can reduce the time and effort of a developer. Component library will be used to develop a model. The performance of a system can be check through the presence of benchmark.