Towards a Process Algebra Framework for Supporting Behavioural Consistency and Requirements Traceability in SysML

Jacobs, Jaco; Simpson, Andrew

doi:10.1007/978-3-642-41202-8_18

Cited by 5 publications

(21 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The above is modelled using the sequential composition operator. The aforementioned behaviours are all SysML activities with corresponding CSP processes; if a behaviour is not present it is simply not included in the sequential composition 10 . Note that, in every state, the dispatched, unexpected events are discarded and thus removed from the event queue without effect: this corresponds to communications of the form local .disc.e, where e is an signal event.…”

Section: State Machinesmentioning

confidence: 99%

“…At the architectural level, however, the integrated behaviour of all the components would be of interest to the modeller. Here, techniques that would assist in assured requirements traceability would be beneficial [10]. Figure 14 depicts these concepts.…”

Section: Controllermentioning

confidence: 99%

“…A similar line of argument can be followed for blocks B and C, together with their component blocks. Safety requirements can be allocated behavioural constructs to further refine the intentions of the modeller, and checked for conformance using CSP [10].…”

Section: Controllermentioning

confidence: 99%

“…Alternatively, the first interpretation might be used again to obtain a single abstract block, modelling the travelling crane, when the system of interest is the production cell. At this level, one might have refinements modelling behavioural safety requirements, as outlined in, for example, [10].…”

Section: Controllermentioning

confidence: 99%

See 3 more Smart Citations

On the formal interpretation and behavioural consistency checking of SysML blocks

Jacobs

Simpson

2015

Softw Syst Model

Self Cite

View full text Add to dashboard Cite

The Systems Modeling Language (SysML) is a semi-formal, graphical modelling language used in the specification and design of systems. We describe how Communicating Sequential Processes (CSP) and its associated refinement checker, FDR3, may be used to underpin an approach that facilitates the refinement checking of the behavioural consistency of SysML diagrams. We achieve this by utilising CSP as a semantic domain for reasoning about SysML behavioural aspects: activities and state machines are given a formal, process-algebraic semantics. These behaviours execute within the context of the structural diagrams to which they relate, and this is reflected in the CSP descriptions that depict their characteristic patterns of interaction. We describe how CSP and FDR3 can be used in conjunction with SysML in a formal, top-down approach to systems engineering. Moreover, the compositionality afforded by CSP alleviates the state space explosion problem frequently encountered with complex formal models, and complements the top-down approach of SysML. Typically, a system is composed from constituent systems using the concept of blocks. SysML permits two alternative interpretations with regards to the behaviour of the resulting composition. We argue that the use of a process-algebraic formalism enables us to explore the relationships between these interpretations in a more rigorous fashion than would otherwise be the case.

show abstract

Section: State Machinesmentioning

confidence: 99%

Section: Controllermentioning

confidence: 99%

Section: Controllermentioning

confidence: 99%

Section: Controllermentioning

confidence: 99%

See 2 more Smart Citations

On the formal interpretation and behavioural consistency checking of SysML blocks

Jacobs

Simpson

2015

Softw Syst Model

Self Cite

View full text Add to dashboard Cite

show abstract

“…They consider the behavior of SysML blocks as a set of composed behavior of state machine and activity diagrams. The specification is mapped to a process-algebraic CSP where assertions about requirements can be proved or refuted (Jacobs & Simpson, 2013). The idea behind is to prove that the refinement is preserved and the automated analysis is computationally feasible.…”

Section: Related Workmentioning

confidence: 99%

A quantitative verification framework of SysML activity diagrams under time constraints

Baouya

Bennouar

Mohamed

et al. 2015

Expert Systems with Applications

View full text Add to dashboard Cite

a b s t r a c tTime-constrained and probabilistic verification approaches gain a great importance in system behavior validation including avionic, transport risk assessment, automotive systems and industrial process controllers. They enable the evaluation of system behavior according to the design requirements and ensure their correctness before any implementation. Due to the difficulty of analyzing, modeling and verifying these large scale systems, we introduce a novel verification framework based on PRISM probabilistic model checker that takes the SysML activity diagram as input and produce their equivalent timed probabilistic automata that is/are expressed in PRISM language. To check the functional correctness of the system under test, the properties are expressed in PCTL temporal logic. To prove the soundness of our mapping approach, we capture the underlying semantics of both the SysML activity diagrams and their generated PRISM code. We found that the timed probabilistic equivalence relation between both semantics preserve the satisfaction of the system requirements. We present digital camera as case study to illustrate the applicability of the proposed approach and to demonstrate its efficiency by analyzing a performability properties.

show abstract

On a Process Algebraic Representation of Sequence Diagrams

Jacobs

Simpson

2015

Software Engineering and Formal Methods

Self Cite

View full text Add to dashboard Cite

Sequence diagrams depict the interaction between entities as a sequence of messages arranged in a temporal order. However, they lack a formal execution semantics: the Unified Modeling Language (UML) specification opts to use natural language to describe fundamental concepts such as interaction operators that alter the behaviour of a fragment. Communicating Sequential Processes (CSP) is a process-algebraic formalism that is suited to modelling patterns of behavioural interaction. Moreover, the associated refinement checker, Failures-Divergence Refinement (FDR), gives rise to a practical approach that enables us to reason about these interactions in a formal setting. In this paper, we show how CSP and FDR have been used to provide a process-algebraic representation of sequence diagrams that is amenable to refinement-checking.

show abstract

Towards a Process Algebra Framework for Supporting Behavioural Consistency and Requirements Traceability in SysML

Cited by 5 publications

References 6 publications

On the formal interpretation and behavioural consistency checking of SysML blocks

On the formal interpretation and behavioural consistency checking of SysML blocks

A quantitative verification framework of SysML activity diagrams under time constraints

On a Process Algebraic Representation of Sequence Diagrams

Contact Info

Product

Resources

About