Show simple item record

dc.contributor.authorBoiten, Eerke Albert
dc.contributor.authorDerrick, J.
dc.date.accessioned2019-04-24T09:01:20Z
dc.date.available2019-04-24T09:01:20Z
dc.date.issued2019-04-18
dc.identifier.citationBoiten, E.A. and Derrick, J. (2019) Understanding, Explaining, and Deriving Refinement. In: Adamatzky, Andrew, Kendon, Viv (Eds.): From Astrophysics to Unconventional Computation, Volume 35 in Emergence, Complexity and Computation, pp. 195-206, Springeren
dc.identifier.isbn9783030157913
dc.identifier.urihttps://www.dora.dmu.ac.uk/handle/2086/17728
dc.description.abstractMuch of what drove us in over twenty years of research in refinement, starting with Z in particular, was the desire to understand where refinement rules came from. The relational model of refinement provided a solid starting point which allowed the derivation of Z refinement rules. Not only did this explain and verify the existing rules - more importantly, it also allowed alternative derivations for different and generalised notions of refinement. In this chapter, we briefly describe the context of our early efforts in this area and Susan Stepney's role in this, before moving on to the motivation and exploration of a recently developed primitive model of refinement: concrete state machines with anonymous transitions.en
dc.language.isoenen
dc.publisherSpringer Natureen
dc.relation.ispartofseriesEmergence, Complexity and Computation;35
dc.subjectrefinementen
dc.subjectstate based systemsen
dc.titleUnderstanding, Explaining, and Deriving Refinementen
dc.typeBook chapteren
dc.identifier.doihttps://doi.org/10.1007/978-3-030-15792-0_8
dc.peerreviewedNoen
dc.funderNo external funderen
dc.cclicenceN/Aen
dc.date.acceptance2019-04-01
dc.researchinstituteCyber Technology Institute (CTI)en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record