Architectural Verification of Control Systems Using CSP

Jesus, Joabe; Mota, Alexandre; Sampaio, Augusto; Grijo, Luiz

doi:10.1007/978-3-642-24559-6_23

Cited by 7 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The failure logic is essential for system safety assessment because it is used as basic input for building fault trees (Papadopoulos et al 2001;Jesus et al 2011;Gomes et al 2010). Furthermore, we still connect the strategy presented in Mota et al (2010) with the works reported in Jesus et al (2011) (functional analysis) and in Gomes et al (2010) and Papadopoulos et al (2001) (safety assessment) because our new algebra is at least a Boolean algebra.…”

Section: Resultsmentioning

confidence: 95%

“…To perform a formal verification in a Simulink system design model, the work reported in Jesus et al (2011) translates a Simulink model to the CSP M language. The resulting CSP M code is then used to check if it meets functional requirements also encoded in CSP M .…”

Section: Systems' Nominal Model and Faults Injectionmentioning

confidence: 99%

“…The work Didier and Mota (2012) was based on Communicating Sequential Processes (CSP M 2 ) (Roscoe 1997; to allow an automatic analysis using the model checker FDR. Thus, our strategy required the translation from Simulink to CSP M (Jesus et al 2011). It then runs FDR to obtain several counter-examples (which are fault traces) ending in failures.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An algebra of temporal faults

Didier

Mota

2016

Inf Syst Front

Self Cite

View full text Add to dashboard Cite

Faults modelling is essential to anticipate failures in critical systems. Traditionally, Static Fault Trees are employed to this end, but Temporal and Dynamic Fault Trees are gaining evidence due to their enriched power to model and detect intricate propagation of faults that lead to a failure. In previous work, we showed a strategy based on the process algebra CSP and Simulink models to obtain fault traces that lead to a failure. Although that work used Static Fault Trees, it could be used with Temporal or Dynamic Fault Trees. In the present work we define an algebra of temporal faults (with a notion of fault propagation) and prove that it is indeed a Boolean algebra. This allows us to inherit Boolean algebra's properties, laws and existing reduction techniques, which are very beneficial for faults modelling and analysis. We illustrate our work on a simple but real case study supplied by our industrial partner EMBRAER.

show abstract

Section: Resultsmentioning

confidence: 95%

Section: Systems' Nominal Model and Faults Injectionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An algebra of temporal faults

Didier

Mota

2016

Inf Syst Front

Self Cite

View full text Add to dashboard Cite

show abstract

“…We conduct five sets of experiments 5 . The first set investigates the performance of refinement checking, by verifying the same model and assertion with different reduction techniques.…”

Section: Methodsmentioning

confidence: 99%

An Analytical and Experimental Comparison of CSP Extensions and Tools

Shi

Liu

Sun

et al. 2012

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Communicating Sequential Processes (CSP) has been widely applied to modeling and analyzing concurrent systems. There have been considerable efforts on enhancing CSP by taking data and other system aspects into account. For instance, CSPM combines CSP with a functional programming language whereas CSP# integrates high-level CSP-like process operators with low-level procedure code. Little work has been done to systematically compare these CSP extensions, which may have subtle and substantial differences. In this paper, we compare CSPM and CSP# not only on their syntax, but also operational semantics as well as their supporting tools such as FDR, ProB, and PAT. We conduct extensive experiments to compare the performance of these tools in different settings. Our comparison can be used to guide users to choose the appropriate CSP extension and verification tool based on the system characteristics.

show abstract

“…Apart from the decomposition, some data abstraction techniques can also be used to optimize the formal model. For example, Jesus et al [23] abstract any infinite domain in the system to allow checking the CSP models using FDR2.…”

Section: Related Workmentioning

confidence: 99%

An Optimization Approach for Effective Formalized fUML Model Checking

Abdelhalim

Schneider

Treharne

2012

Software Engineering and Formal Methods

View full text Add to dashboard Cite

Abstract. Automatically formalizing fUML models into CSP is a challenging task. However, checking the generated CSP model using FDR2 is far more challenging. That is because the generated CSP model holds many implementation details inherited from the fUML model, as well as the formalization of the non-trivial fUML inter-object communication mechanism. Using the state space compression techniques available in FDR2 (such as Supercompilation and compression functions) is not enough to provide an effective model checking that avoids the state explosion problem. In this paper we introduce a novel approach that makes use of a restricted CSP model (because it follows certain formalization rules) to optimize the generated model. As an application of our approach, we design a framework that works on two levels; the first one provides optimization advice to the modeller, while the second one automatically applies optimization rules which transform the CSP model to a more optimized one. Implementing and applying the approach on two large case studies demonstrated the effectiveness of the approach. We also proved that the optimization rules are safe to be applied automatically without eliminating important information from the CSP model.

show abstract

Architectural Verification of Control Systems Using CSP

Cited by 7 publications

References 14 publications

An algebra of temporal faults

An algebra of temporal faults

An Analytical and Experimental Comparison of CSP Extensions and Tools

An Optimization Approach for Effective Formalized fUML Model Checking

Contact Info

Product

Resources

About