Refining Nodes and Edges of State Machines

Hallerstede, Stefan; Snook, Colin

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

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The event traces of And pattern is: <Event1，AndEvent1，AndEvent2，Event3> or <Event1,AndEvent2,AndEvent1，Event3>.  Xor pattern The Xor pattern is shown in Figure 1 (d [11]and [12]. Hallerstede proposed an idea of the control flow modelling of the Event-B model, and pointed out that during the refinement of the Event-B model, edge refinement (or event refinement) and node refinement (or state refinement) are similar.…”

Section: Event Refinement Using Iuml-b State Machinementioning

confidence: 99%

Modeling Control Flow of Event-B Using State Transition System

2017

Proceedings of 2017 the 7th International Workshop on Computer Science and Engineering

View full text Add to dashboard Cite

There are some limitations of Event-B method in expressing the event order of system. In order to solve this problem, event refinement structure method was proposed to model the system refinement structure and control flow. However, the event refinement structure diagram cannot directly map to a behavioral semantic model such as communication sequence process or labeled transition system, and is inconvenient to verify the behavior properties of system. In this paper, we propose a general method to model the control flow of the Event-B model with the iUML-B state machine; so that it has the same event traces as the event refinement structure method. Then, we use a simple case to prove the practicality of this method. Finally, we map the iUML-B state machine to a labeled transition system and verify the behavior properties of the system.

show abstract

Section: Event Refinement Using Iuml-b State Machinementioning

confidence: 99%