Abstract
The evolution of cyber-physical systems (CPS) is inevitable. Traditional graph and hypergraph modeling and analysis methods can only describe one-dimensional evolutionary information, making it difficult to directly apply them to the modeling and analysis of CPS evolution processes that involve two-dimensional space. To address this issue, this paper proposes a Bigraph model for CPS that incorporates positional constraints. This model adopts a divide-and-conquer strategy, utilizing the link graph and place graph of Bigraph to represent the two-dimensional relationships of connectivity and positional relationships among entities within the CPS, respectively. Based on this model, a set of dynamic evolution rules for CPS architecture is designed. Furthermore, by leveraging the concepts of conditional matching and state transition, a model for the dynamic evolution of CPS structure and information flow evolution is proposed. Algorithms for checking consistency, integrity, and reachability constraints during the dynamic evolution of CPS architecture are developed around this model. These algorithms ensure the correctness and reliability of the CPS system after its dynamic evolution. Finally, experiments are conducted using the evolution of a smart meeting system and a vehicular networking system as case studies, validating the effectiveness of the proposed model and algorithms.