A composable discrete-time cellular automaton formalism

Gary R. Mayer, Hessam S. Sarjoughian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

Existing Cellular Automata formalisms do not consider heterogenous composition of models. Simulations that are grounded in a suitable modeling formalism offer unique benefits as compared with those that are developed using an adhoc combination of modeling concepts and implementation techniques. The emerging and extensive use of CA in simulating complex heterogeneous network systems heightens the importance of formal model specification. An extended discrete-time CA modeling formalism is developed in the context of hybrid modeling with support for external interactions.

Original languageEnglish (US)
Title of host publicationSocial Computing, Behavioral Modeling, and Prediction, 2008
EditorsJohn J. Salerno, Michael J. Young, Huan Liu
PublisherSpringer
Pages187-196
Number of pages10
ISBN (Print)9780387776712
DOIs
StatePublished - Jan 1 2008
Event1st International workshop on Social Computing, Behavioral Modeling and Prediction, 2008 - Phoenix, United States
Duration: Apr 1 2008Apr 2 2008

Publication series

NameSocial Computing, Behavioral Modeling, and Prediction, 2008

Conference

Conference1st International workshop on Social Computing, Behavioral Modeling and Prediction, 2008
CountryUnited States
CityPhoenix
Period4/1/084/2/08

ASJC Scopus subject areas

  • Modeling and Simulation

Fingerprint Dive into the research topics of 'A composable discrete-time cellular automaton formalism'. Together they form a unique fingerprint.

  • Cite this

    Mayer, G. R., & Sarjoughian, H. S. (2008). A composable discrete-time cellular automaton formalism. In J. J. Salerno, M. J. Young, & H. Liu (Eds.), Social Computing, Behavioral Modeling, and Prediction, 2008 (pp. 187-196). (Social Computing, Behavioral Modeling, and Prediction, 2008). Springer. https://doi.org/10.1007/978-0-387-77672-9_21