A composable discrete time cellular automaton formalism
Download
1 / 5

A Composable Discrete-Time Cellular Automaton Formalism - PowerPoint PPT Presentation


  • 74 Views
  • Uploaded on

A Composable Discrete-Time Cellular Automaton Formalism. Gary R. Mayer Hessam S. Sarjoughian [email protected] [email protected] Arizona Center for Integrative Modeling & Simulation SBP ’08 01 April 2008 Phoenix, Arizona. Rationale.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' A Composable Discrete-Time Cellular Automaton Formalism' - desmond-clear


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
A composable discrete time cellular automaton formalism

A Composable Discrete-TimeCellular Automaton Formalism

Gary R. Mayer Hessam S. Sarjoughian

[email protected] [email protected]

Arizona Center for Integrative Modeling & Simulation

SBP ’08

01 April 2008

Phoenix, Arizona


Rationale
Rationale

  • Cellular Automata has a central role in simulating many physical systems such as landscape processes

  • Interesting complex systems can be best described using CA and other kinds of models

    • Example: sustainable socio-ecological organizations


Ca approaches
CA Approaches

  • CA is intuitive for representing processes that can be cast into uniform structure with varied behavior – e.g., land surface erosion

  • CA is used to represent non-cellular abstractions –e.g., restrictive for agent decision making

  • CA is often combined with other models using arbitrary data and control schemes – e.g., programming languages

  • Existing CA formalisms treat CA as a grey box

    • Initialize and peek at current state


Composable ca
Composable CA

  • ComposableCA extends the CA formalism to formally represent non-cellular model interactions

  • Benefits

    • Avoid ambiguous composition of CAs with other models through formal description of I/O relationships

    • Improve hybrid modeling for CA models

      • Support detailed representations of agent and landscape process interactions

    • Simplify model verification and simulation validation

      • Model interaction visibility


Composable ca specification

2

1

0

y

z

x

Composable CA Specification

  • Represented as a network, N, of cells (individual automata)

  • N =  XN , YN , D, {Mijk},T, F , where

    Mijk =  Xijk , Yijk , Qijk , Iijk ,ijk ,ijk ,T 

    F = { fin , fout }

  • Difference between multi-dimensional CA and two composed CCAs is in the mapping

Distinguishes between internal and external I/O

Specific mapping functions between cells and network as an entity


ad