Advertisement
Published in:
2008 | OriginalPaper | Chapter
A Composable Discrete-Time Cellular Automaton Formalism
Authors : Gary R Mayer, Hessam S Sarjoughian
Published in: Social Computing, Behavioral Modeling, and Prediction
Publisher: Springer US
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.