An analysis of the control hierarchy modelling of the CMS detector control system
The supervisory level of the Detector Control System (DCS) of the CMS experiment is implemented using Finite State Machines (FSM), which model the behaviours and control the operations of all the sub-detectors and support services. The FSM tree of the whole CMS experiment consists of more than 30.000 nodes. An analysis of a system of such size is a complex task but is a crucial step towards the improvement of the overall performance of the FSM system. This paper presents the analysis of the CMS FSM system using the micro Common Representation Language 2 (mcrl2) methodology. Individual mCRL2 models are obtained for the FSM systems of the CMS sub-detectors using the ASF+SDF automated translation tool. Different mCRL2 operations are applied to the mCRL2 models. A mCRL2 simulation tool is used to closer examine the system. Visualization of a system based on the exploration of its state space is enabled with a mCRL2 tool. Requirements such as command and state propagation are expressed using modal mu-calculus and checked using a model checking algorithm. For checking local requirements such as endless loop freedom, the Bounded Model Checking technique is applied. This paper discusses these analysis techniques and presents the results of their application on the CMS FSM system.
- Research Organization:
- Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), High Energy Physics (HEP)
- DOE Contract Number:
- AC02-07CH11359
- OSTI ID:
- 1433339
- Report Number(s):
- FERMILAB-CONF-11-859-PPD; 1111500
- Journal Information:
- J.Phys.Conf.Ser., Vol. 331; Conference: 18th International Conference on Computing in High Energy and Nuclear Physics, Taipei, Taiwan, 10/18-10/22/2010
- Country of Publication:
- United States
- Language:
- English
Similar Records
MO-PIS-Exhibit Hall-01: Imaging: CT Dose Optimization Technologies I
Reasoning about nondeterministic and concurrent actions: A process algebra approach