Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Modeling and simulating dynamic systems require to represent their processes and the system changes within one model. To that effect, reconfigurable Petri nets consist of a  place/transition net and a set of rules that can  modify the Petri net. The application of a rule is based on finding a suitable match of the rule in the given net. This match is an isomorphic  subnet that  has to be located meeting  requirements of the rule application as ll as the simulation.  a non-deterministic algorithm is presented for the matching in reconfigurable Petri nets. It is an extension of the VF2 algorithm for graph (sub-)isomorphisms.  show that this extension is correct and complete.   Non-determinism  ensures that during simulation different matches can be found for  each transformation step and is hence crucial for the simulation. But non-determinism has not been present in the VF2 algorithm. For the matching algorithm non-determinism is proven.
['Julia Padberg', 'Mathias Blumreiter']
I am writing a research paper on a idea Non-Deterministic Matching Algorithm for Net Transformations
[{"from": "human", "value": "I am writing a research paper on a idea Non-Deterministic Matching Algorithm for Net Transformations"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Modeling and simulating dynamic systems require to represent their processes and the system changes within one model. To that effect, reconfigurable Petri nets consist of a \u00a0place/transition net and a set of rules that can \u00a0modify the Petri net. The application of a rule is based on finding a suitable match of the rule in the given net. This match is an isomorphic \u00a0subnet that \u00a0has to be located meeting \u00a0requirements of the rule application as ll as the simulation.  a non-deterministic algorithm is presented for the matching in reconfigurable Petri nets. It is an extension of the VF2 algorithm for graph (sub-)isomorphisms.  show that this extension is correct and complete. \u00a0\u00a0Non-determinism \u00a0ensures that during simulation different matches can be found for \u00a0each transformation step and is hence crucial for the simulation. But non-determinism has not been present in the VF2 algorithm. For the matching algorithm non-determinism is proven."}]