Demon controlled simulation
András Jávor
Mathematics and Computers in Simulation (MATCOM), 1992, vol. 34, issue 3, 283-296
Abstract:
As an introduction the recursive and iterative process of problem solving by simulation is dealt with and the possibility of enhancing its effectivity by utilizing a knowledge base and an inference engine are described. The necessity of modifying both the experimental conditions and the model itself — with respect to model structure and parameters — are discussed. The principle of demon controlled simulation is introduced. The advantages of the event driven activation of sleeping procedures with respect to run time efficiency as well as the advantages achieved by the distributed control are outlined. Finally, the methodology is illustrated on two examples using the CASSANDRA simulation system where the principles described have been implemented. The first example is a producer–consumer model where the optimal number of consumers is determined by structural changes of the model. In the second example the demons determine the throughput of two production systems by parametrical changes in the experiment control, while by means of one demon — used as an inherent part of the model — an adaptive model is built.
Date: 1992
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475492900063
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:34:y:1992:i:3:p:283-296
DOI: 10.1016/0378-4754(92)90006-3
Access Statistics for this article
Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens
More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().