Authors:
Chams Eddine Choucha
1
;
Mohamed Ramdani
1
;
Mohamed Khalgui
2
and
Laid Kahloul
3
Affiliations:
1
National Institute of Applied Sciences and Technology, University of Carthage, Tunis, Tunisia, University of Tunis El Manar, Tunis, Tunisia
;
2
National Institute of Applied Sciences and Technology, University of Carthage, Tunis, Tunisia
;
3
Computer Science Department, Biskra University, Biskra, Algeria
Keyword(s):
Discrete-event System, Reconfiguration, R-TNCES, Computation Tree Logic, CTL, Cloud Computing, Formal Verification.
Abstract:
This paper deals with reconfigurable discrete event/control systems (RDECSs) that dynamically change their structures due to external changes in environment or user requirements. RDECSs are complex and critical. The verification of these systems continues to challenge experts in both academia and industry since the generated state spaces are much bigger and the properties to be verified are more complex. Reconfigurable Timed Net Condition/Event Systems (R-TNCESs) are proposed as an extension of the Petri nets formalism for the optimal functional and temporal specification of RDECSs. Real systems model can encompass millions of transitions which, implies huge state spaces and complex properties to be verified. To control the complexity and to reduce the verification time, a new method of CTL properties verification in a cloud-based architecture is proposed. The novelty consists in a new method for state space generation and the decomposition of the complex properties for running an ef
ficient verification. An algorithm is proposed for the incremental state space generation. A case study is exploited to illustrate the impact of using this technique. The current results show the benefits of the paper’s contribution.
(More)