A calculus for multi-level emergent behaviours in component-based systems and simulations

A major issue in Complexity Science is the formal description of emergent properties and behaviours in terms of lower level properties and behaviours. As a consequence, there are few techniques for empirically investigating specific emergent properties. In this paper, we introduce a general compositional approach to specifying such properties, using constraints to define representative sets of compositions. More specifically, we propose a calculus of complex events, which are compositions of events generated from component-level rule executions. Complex event types can be assembled hierarchically, giving a formal means of relating behaviours at different levels of abstraction. In being able to specify and then identify complex events of different types in systems and simulations, we have a method for empirically discovering relationships between behaviours defined at different levels. The formalism offers two important practical advantages. Firstly, higher level properties can be defined with different degrees of specificity so they can be defined with limited knowledge; we can then further sub-classify properties after they have been detected to discover differences in their constituent properties. Secondly, the formalism is related directly to the rules driving component behaviour so that all higher level behaviours can ultimately be decomposed into rule executions; this is particularly important for desirable and dysfunctional properties, and in circumstances where intervention at the component rule level is possible.

[1]  Rudolf Freund,et al.  Cooperating Array Grammar Systems , 1995, Int. J. Pattern Recognit. Artif. Intell..

[2]  Michael Luck,et al.  Agent Technology from a Formal Perspective , 2006 .

[4]  J. Woodward,et al.  Scientific Explanation and the Causal Structure of the World , 1988 .

[5]  Moshe Sipper,et al.  Design, Observation, Surprise! A Test of Emergence , 1999, Artificial Life.

[6]  Christopher D. Clack,et al.  Specifying, detecting and analysing emergent behaviours in multi-level agent-based simulations , 2007, SCSC.

[7]  Fabio Boschetti,et al.  Emergence and computability , 2007 .

[8]  M. Potter,et al.  Sets: An Introduction , 1990 .

[9]  Faron Moller Logics for concurrency: structure versus automata , 1996, CSUR.

[10]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[11]  P. Odifreddi,et al.  Incomputability in Nature , 2003 .

[12]  S. Barry Cooper,et al.  Computability And Models , 2003 .

[13]  P. Grassberger Toward a quantitative theory of self-generated complexity , 1986 .

[14]  M. Friedman Explanation and Scientific Understanding , 1974 .

[15]  C. Petri Kommunikation mit Automaten , 1962 .

[16]  Cosma Rohilla Shalizi,et al.  Methods and Techniques of Complex Systems Science: An Overview , 2003, nlin/0307015.

[17]  Clare Dixon,et al.  On Formal Specification of Emergent Behaviours in Swarm Robotic Systems , 2005 .

[18]  D. Corfield Conceptual mathematics: a first introduction to categories , 2002 .

[19]  Ales Kubík,et al.  Toward a Formalization of Emergence , 2002, Artif. Life.

[20]  Markus Christen,et al.  The Concept of Emergence in Complexity Science: Finding Coherence between Theory and Practice , 2004 .

[21]  Laurent Magnin,et al.  Elements about the Emergence Issue: A Survey of Emergence Definitions , 2006, Complexus.

[22]  Alex J. Ryan,et al.  Emergence is coupled to scope, not level , 2006, Complex..

[23]  M. Holcombe,et al.  A Formal Method for the Development of Agent-Based Systems , 2003 .

[24]  Robert Haslinger,et al.  Publisher's Note: Quantifying Self-Organization with Optimal Predictors [ Phys. Rev. Lett. 93, 118701 (2004)] , 2004 .

[25]  Fabio Boschetti,et al.  A Turing Test for Emergence , 2008, Advances in Applied Self-organizing Systems.

[26]  Mikhail Prokopenko,et al.  Defining and Detecting Emergence in Complex Networks , 2005, KES.