An Automatic Approach to Model Checking UML State Machines

Zhang, Shao Jie; Liu, Yang

doi:10.1109/ssiri-c.2010.11

Cited by 36 publications

(34 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 2a describes function SupEn() (used in [1]). This function takes as parameters a state s and the global state machine, (a) Specification using an SMD Figure 1: An example of a CD player [13] and writes to the output file the entry behaviour of s. This function mixes control structures to find the entry behaviour with the CPN code to be written to the output file. Another example of the use of functions is given in Figure 2b.…”

Section: Preliminariesmentioning

confidence: 99%

Translating UML State Machines to Coloured Petri Nets Using Acceleo: A Report

André

Benmoussa

Choppy

2014

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

UML state machines are widely used to specify dynamic systems behaviours. However its semantics is described informally, thus preventing the application of model checking techniques that could guarantee the system safety. In a former work, we proposed a formalisation of non-concurrent UML state machines using coloured Petri nets, so as to allow for formal verification. In this paper, we report our experience to implement this translation in an automated manner using the model-totext transformation tool Acceleo. Whereas Acceleo provides interesting features that facilitated our translation process, it also suffers from limitations uneasy to overcome.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Translating UML State Machines to Coloured Petri Nets Using Acceleo: A Report

André

Benmoussa

Choppy

2014

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…In the study by Hansen et al (2010), state machines are formalized with mCRL2 (Groote et al, 2007), a language based on the algebra of communicating process (Baeten and Weijland, 1990), and the model is verified using the mCRL2 toolset. In the studies by Rasch and Wehrheim (2003), Ng and Butler (2003) and Zhang and Liu (2010), CSP is selected as the process algebra to formalize state machines. The formalization by Ng and Butler (2003) can handle entry and exit behaviors, but cannot handle some pseudostates which represent complex transitions.…”

Section: Related Workmentioning

confidence: 99%

“…The work gives a formalization in which state machines are translated into CSP#, a variant language of CSP. In this paper, we make modifications to some translation rules proposed in Zhang and Liu (2010), and add several rules for components of state machine diagrams that are not dealt with in that work.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Translation rules of SysML state machine diagrams into CSP# toward formal model checking

Ando

Yatsu

Kong

et al. 2014

International Journal of Web Information Systems

View full text Add to dashboard Cite

Purpose – This study aims to describe the behavior of blocks in the system under consideration using systems modeling language (SysML) state machine diagrams. In this paper, formalization and model checking for SysML state machine diagrams have been investigated. Design/methodology/approach – The work by Zhang and Liu (2010) proposed a formalization of SysML state machine diagrams in which the diagrams were translated into CSP# processes that could be verified by the state-of-the-art model checker PAT. In this paper, several modifications have been made and new rules have been added to the translation described in that work. Findings – First, three translation rules were modified, which apparently are inappropriately defined according to the SysML definition of state machine diagrams. Next, we add new translation rules for two components of the diagrams – junction and choice pseudostates – which have not been dealt with previously. Further, we are implementing the automatic translation system on a web-based model-driven development tool, which reflects on our translation rules. Originality/value – As the contribution of this work, more reasonable verification results for more general SysML state machine diagrams can be achieved.

show abstract

“…to stochastic Petri nets. In [21] and [2], various syntactic features of UML state machines are translated into CSP# and colored Petri nets, respectively. Also note that [11] proposes an operational semantics of the activity diagrams (for UML 2.2).…”

Section: Introductionmentioning

confidence: 99%

Activity Diagrams Patterns for Modeling Business Processes

André

Choppy

Reggio³

2014

Software Engineering Research, Management and Applications

View full text Add to dashboard Cite

Designing and analyzing business processes is the starting point of the development of enterprise applications, especially when following the SOA (Service Oriented Architecture) paradigm. UML activity diagrams are often used to model business processes. Unfortunately, their rich syntax favors mistakes by designers; furthermore, their informal semantics prevents the use of automated verification techniques. In this paper, (i) we propose activity diagram patterns for modeling business processes, (ii) we devise a modular mechanism to compose diagram fragments into a UML activity diagram, and (iii) we propose a semantics for the produced activity diagrams, formalized by colored Petri nets. Our approach guides the modeler task (helping to avoid common mistakes), and allows for automated verification.

show abstract

An Automatic Approach to Model Checking UML State Machines

Cited by 36 publications

References 7 publications

Translating UML State Machines to Coloured Petri Nets Using Acceleo: A Report

Translating UML State Machines to Coloured Petri Nets Using Acceleo: A Report

Translation rules of SysML state machine diagrams into CSP# toward formal model checking

Activity Diagrams Patterns for Modeling Business Processes

Contact Info

Product

Resources

About