Generalized stochastic Petri nets (GSPNs) have been extended to several dynamic-structure formalisms providing suitable tools for the modeling and verification of reconfigurable discrete-event systems (R-DESs). However, analyzing the performance of large-complex R-DESs remains a big challenging issue. Indeed, dynamic-structure GSPNs still rely on old-fashioned techniques often causing the state-space explosion problem. In this article, we present a new technique for the quantitative analysis of a dynamic-structure formalism called reconfigurable GSPNs without computing the whole state space. This work describes new reconfiguration forms used to preserve desired quantitative properties of parts of interest after each reconfiguration. Therefore, it is only required to verify the examined properties at an initial configuration. The proposed technique is proven to effectively reduce the state space and shorten the computation time in such cases. Finally, some experimental results are provided to illustrate that, from a computational perspective, the developed approach outperforms the existing tools.
1 September 2019 in Science of Computer Programming
Modern discrete-event systems (DESs) are often characterized by their dynamic structures enabling highly flexible behaviors that can respond in real time to volatile environments. On the other hand, timed automata (TA) are powerful tools used to design various DESs. However, they lack the ability to naturally describe dynamic-structure reconfigurable systems. Indeed, TA are characterized by their rigid structures, which cannot handle the complexity of dynamic structures. To overcome this limitation, we propose an extension to TA, called dynamic timed automata (DTA), enabling the modeling and verification of reconfigurable systems. Additionally, we present a new algorithm that transforms DTA into semantic-equivalent TA while preserving their behavior. We demonstrate the usefulness and applicability of this new modeling and verification technique using an illustrative example.