Skip to Main Content
The flexible component assembly technology can solve complex system modeling efficiently. Based on graph reductions and category morphism, J.Padberg, H.Ehrig et al presented two frameworks of generic component and its assembly using Petri nets. One was restricted to component with a single import and export interface, the other was based on connector with multiple imports and component with multiple exports. The latter was more flexible than the former on component description and assembly. H.Ehrig discussed the latter whole architecture with rule-based refinement. However, the import interfaces of connector were restricted to disjunction and the assembly algorithm was ignored in each reduction step. Therefore, composition algorithm, independent condition and architecture uniqueness proof are put forward in this paper. An instance of interlocking logic based on this framework is illustrated in the end.