creators_name: Hallerstede, Stefan creators_name: Snook, Colin type: conference_item datestamp: 2012-07-23 09:55:40 lastmod: 2012-07-23 09:55:40 metadata_visibility: show title: Refining Nodes and Edges of State Machines ispublished: pub subjects: Refinement full_text_status: none pres_type: paper keywords: Refinement State Machines note: Event Dates: 26th--28th October 2011 abstract: State machines are hierarchical automata that are widely used to structure complex behavioural specifications. We develop two notions of refinement of state machines, node refinement and edge refinement. We compare the two notions by means of examples and argue that, by adopting simple conventions, they can be combined into one method of refinement. In the combined method, node refinement can be used to develop architectural aspects of a model and edge refinement to develop algorithmic aspects. The two notions of refinement are grounded in previous work. Event-B is used as the foundation for our refinement theory and UML-B state machine refinement influences the style of node refinement. Hence we propose a method with direct proof of state machine refinement avoiding the detour via Event-B that is needed by UML-B. date: 2011-10 date_type: published event_title: ICFEM 2011: 13th International Conference on Formal Engineering Methods event_type: conference refereed: TRUE official_url: http://eprints.soton.ac.uk/272940/ citation: Hallerstede, Stefan and Snook, Colin (2011) Refining Nodes and Edges of State Machines. In: ICFEM 2011: 13th International Conference on Formal Engineering Methods.