Emergent Properties Do Not Refine

Authors:
Fiona Polack;Susan Stepney
Affiliations:
Department of Computer Science, University of York, Heslington, York, YO10 5DD, UK;Department of Computer Science, University of York, Heslington, York, YO10 5DD, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 7
Cited 3

Data refinement refined

Proc. of the European symposium on programming on ESOP 86
Flocks, herds and schools: A distributed behavioral model

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Programming from specifications (2nd ed.)

Programming from specifications (2nd ed.)
Classifying cellular automata automatically: finding gliders, filtering, and relating space-time patterns, attractor basins, and the Z parameter

Complexity
Simple Computation-Universal Cellular Spaces

Journal of the ACM (JACM)
Design, observation, surprise! A test of emergence

Artificial Life
An outline pattern language for Z: five illustrations and two tables

ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B

Refining Emergent Properties

Electronic Notes in Theoretical Computer Science (ENTCS)
An architecture for modelling emergence in CA-Like systems

ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
Defining and decomposing safety policy for systems of systems

SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Refinement is conventionally used to effect a demonstrably-correct development from an abstract specification. Emergent systems present an interesting challenge in terms of demonstrably-correct development, because there is a discontinuity between the global and local system descriptions. This is a position paper, exploring some aspects of the challenge in relation to the traditional model of refinement.