@inproceedings{deploy428,
       booktitle = {ICFEM 2011: 13th International Conference on Formal Engineering Methods},
           month = {October},
           title = {Refining Nodes and Edges of State Machines},
          author = {Stefan Hallerstede and Colin Snook},
            year = {2011},
            note = { Event Dates: 26th--28th October 2011},
        keywords = {Refinement State Machines},
             url = {http://deploy-eprints.ecs.soton.ac.uk/428/},
        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.}
}

<script src='//archive-bar.soton.ac.uk/archive-bar.js'></script>