The University of Southampton
University of Southampton Institutional Repository

Refining Nodes and Edges of State Machines

Refining Nodes and Edges of State Machines
Refining Nodes and Edges of State Machines
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.
Refinement State Machines
Hallerstede, Stefan
417e8daa-4c97-4b71-b7db-562538de915f
Snook, Colin
b2055316-9f7a-4b31-8aa1-be0710046af2
Hallerstede, Stefan
417e8daa-4c97-4b71-b7db-562538de915f
Snook, Colin
b2055316-9f7a-4b31-8aa1-be0710046af2

Hallerstede, Stefan and Snook, Colin (2011) Refining Nodes and Edges of State Machines. ICFEM 2011: 13th International Conference on Formal Engineering Methods, Durham, United Kingdom. 25 - 27 Oct 2011.

Record type: Conference or Workshop Item (Paper)

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.

Text
sesmref.pdf - Accepted Manuscript
Download (306kB)

More information

Published date: 27 October 2011
Additional Information: Event Dates: 26th—28th October 2011
Venue - Dates: ICFEM 2011: 13th International Conference on Formal Engineering Methods, Durham, United Kingdom, 2011-10-25 - 2011-10-27
Keywords: Refinement State Machines
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 272940
URI: http://eprints.soton.ac.uk/id/eprint/272940
PURE UUID: 3fa7c1a2-01fa-4502-9389-c880bcba2d66
ORCID for Colin Snook: ORCID iD orcid.org/0000-0002-0210-0983

Catalogue record

Date deposited: 20 Oct 2011 08:37
Last modified: 09 Jan 2022 03:08

Export record

Contributors

Author: Stefan Hallerstede
Author: Colin Snook ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×