Abstract
Model refinement is an important step in the model building process. For reaction-based models, data refinement consists in replacing one species with several of its variants in the refined model. We discuss in this paper the implementation of data refinement with Petri nets such that the size of the model (in terms of number of places and transitions) does not increase. We capture the compositional structure of species by introducing a new class of Petri nets, composition Petri nets (ComP-nets), and their colored counterpart, colored composition Petri nets (ComCP-nets). Given a reaction-based model with known compositional structure, represented as a ComP-net, we propose an algorithm for building a ComCP-net which implements the data refinement of the model and has the same network structure as the initial ComP-net.
Original language | Undefined/Unknown |
---|---|
Pages (from-to) | 51–72 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 326 |
DOIs | |
Publication status | Published - 2016 |
MoE publication type | A1 Journal article-refereed |