System States Transition Safety Analysis Method Based on FSM and NuSMV

Ding, Yuxin; Weigang, Li; Zhong, Deming; Huang, Hao; Zhao, Yuejen; Xu, Zhi

doi:10.1145/3180374.3181346

Cited by 11 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ding et al [20] present a method that combines Finite State Machine (FSM) and model checking. They aim to avoid system abnormalities in the safety analysis method caused by errors in the control signals.…”

Section: Related Workmentioning

confidence: 99%

Synthesis of a Controller Algorithm for Safety-Critical Systems

2022

View full text Add to dashboard Cite

Systems of today are becoming more complex; they have many levels of the control hierarchy, are software-intensive, use different networks, have increasing processing power, use a diversity of devices, and require more integration. Systems-Theoretic Process Analysis (STPA) is a technique that is being used to analyze the safety of those systems at the concept stage. For the design phase, STPA can be combined with SysML modeling activities, including simulation and formal verification of systems models to produce the control software more efficiently. However, for the design phase, when starting from the STPA analysis there is no support to elaborate the control algorithm. Building the control algorithm is one of the most difficult tasks in the design phase. We propose a method to synthesize the control algorithm for safetycritical systems from the STPA analyses and the functional requirements. Our method maps the control structure (STPA) into a block diagram (SysML), and it uses the STPA results to generate an initial state machine diagram (SysML) for automated controllers, actuators, and sensors. We use our method to generate the control algorithms for an Adaptive Cruise Control system. We evaluate the synthesized algorithms by performing model simulation and formal verification. This illustrates that our method is a systematic way to synthesize control algorithms that satisfy both safety and functional requirements.INDEX TERMS Safety, Systems Modeling Language, Model checking, Control system synthesis, System analysis and design.

show abstract

Section: Related Workmentioning

confidence: 99%

Synthesis of a Controller Algorithm for Safety-Critical Systems

2022

View full text Add to dashboard Cite

show abstract

“…Though this method improved efficiency a lot, they relied on experts' experience heavily, making it hard to apply in large scale network. Ding et al presented a method which is based on the combination of finite state machine(FSM) and model checking technology(NuSMV) to analyse system safety [14]. To discover optimal attack path, Zhao et al toke advantage of ant colony algorithm to optimize global security cost [15].…”

Section: Related Workmentioning

confidence: 99%

An Improved Attack Path Discovery Algorithm Through Compact Graph Planning

Zang

Zhou

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Attack path discovery plays an important role in protecting network infrastructure. Unfortunately, previous attack path discovery algorithms are difficult for applying in reality because of the high computational complexity problem. To achieve effective attack path discovery, we proposed a compact graph planning algorithm to incorporate goal states related information into attack path discovery. Our model extracts goal states related information by calculating closure of goal states, and then construct planning graph structure given the closure, after which the backward search algorithm is used to extract the attack path solution. The experiments were done on the typical enterprise network, comparing the effectiveness of attack path discovery algorithms with existing known methods. The result turns out that our proposed compact graph planning algorithm shows great improvement in discovering attack paths. INDEX TERMS Attack path discovery, graph planning, functional dependency theory, cyber security. I. INTRODUCTION With the increasing size and complexity of computer network, cyber security problem becomes more prominent than ever. Community Emergency Response Team(CERT) points out that global network security events increase exponentially from 2003 to 2018 [1]. To cope with the problem, attack paths discovery technology [2], which could discover hidden network vulnerabilities automatically, is widely adopted. As shown in Figure 1, attack paths discovery technology could not only find individual vulnerability existed in each host, but combinational vulnerabilities existed in whole network. Although tools like APT2 [3], Autosploit [4] and MulVAL [5] etc. have been developed to improve efficiency for discovering hidden attack paths, they are still far from reality because of two limitations. The first is that most of these tools, such as APT2, Autosploit and so on, aim at discovering individual vulnerabilities and fail in finding combinational vulnerabilities, and the second is that high computational complexity problem makes it hard to apply in large scale network. The associate editor coordinating the review of this manuscript and approving it for publication was Alba Amato.

show abstract

“…Volk et al [18] presented a new and fast DFT analysis using probabilistic model checking. For the sake of making model-based techniques in industrial software development more efficient, Ding et al [19] presented a method that combines the respective advantages of finite state machines (FSMs) and model checking technology. Villani et al [20] combined two formal verification applications -formal UPPAAL and conformance and fault injection (CoFI) -and apply the improved model verification to three cases, finally concluding that the combination of two verification techniques contributes to the identification of a large scale of diversified errors.…”

Section: Background and Preliminariesmentioning

confidence: 99%

Qualitative analysis for state/event fault trees using formal model checking

Jiang

Zhu

Siqi

2019

Journal of Systems Engineering and Electronics

View full text Add to dashboard Cite

A state/event fault tree (SEFT) is a modeling technique for describing the causal chains of events leading to failure in software-controlled complex systems. Such systems are ubiquitous in all areas of everyday life, and safety and reliability analyses are increasingly required for these systems. SEFTs combine elements from the traditional fault tree with elements from state-based techniques. In the context of the real-time safety-critical systems, SEFTs do not describe the time properties and important timedependent system behaviors that can lead to system failures. Further, SEFTs lack the precise semantics required for formally modeling time behaviors. In this paper, we present a qualitative analysis method for SEFTs based on transformation from SEFT to timed automata (TA), and use the model checker UPPAAL to verify system requirements' properties. The combination of SEFT and TA is an important step towards an integrated design and verification process for real-time safety-critical systems. Finally, we present a case study of a powerboat autopilot system to confirm our method is viable and valid after achieving the verification goal step by step.

show abstract

System States Transition Safety Analysis Method Based on FSM and NuSMV

Cited by 11 publications

References 22 publications

Synthesis of a Controller Algorithm for Safety-Critical Systems

Synthesis of a Controller Algorithm for Safety-Critical Systems

An Improved Attack Path Discovery Algorithm Through Compact Graph Planning

Qualitative analysis for state/event fault trees using formal model checking

Contact Info

Product

Resources

About