A Simulation-Oriented Formalization for a Psychological Theory

Silva, Paulo Salem da; Melo, Ana Duarte

doi:10.1007/978-3-540-71289-3_5

Cited by 5 publications

(2 citation statements)

References 4 publications

(2 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In both examples, the behavior of each individual agent is likely to be complex, and if a model is given to them, it probably will not be a simple one. 34 But the environment, on the other hand, can be described by some formalism that merely define what operations can be performed on agents, as well as relations among agents (e.g. using a process algebra such as the π -calculus 1 ), providing a much more tractable model.…”

Section: Automation Of Experimentsmentioning

confidence: 99%

See 1 more Smart Citation

On-the-fly verification of discrete event simulations by means of simulation purposes: Extended version

Silva

Melo

2013

SIMULATION

View full text Add to dashboard Cite

Discrete event simulations can be used to analyze natural and artificial phenomena. To this end, one provides models whose behaviors are characterized by discrete events in a discrete timeline. By running such a simulation, one can then observe its properties. This suggests the possibility of applying on-the-fly verification procedures during simulations. In this work we propose a method by which this can be accomplished. It consists of modeling the simulation as a transition system (implicitly), and the property to be verified as another transition system (explicitly). The latter we call a simulation purpose and it is used both to verify the success of the property and to guide the simulation. Algorithmically, this corresponds to building a synchronous product of these two transitions systems on-the-fly and using it to operate a simulator. By the end of such an algorithm, it may deliver either a conclusive or inconclusive verdict. If conclusive, it becomes known whether the simulation model satisfies the simulation purpose. If inconclusive, it is possible to adjust certain parameters and try again. The precise nature of simulation purposes, as well as the corresponding satisfiability relations and verification algorithms, are largely determined by methodological considerations important for the analysis of simulations, whose computational characteristics we compare with empirical scientific procedures. We provide a number of ways in which such a satisfiability relation can be defined formally, the related algorithms, and mathematical proofs of soundness, completeness and complexities. Two application examples are given to illustrate the approach.

show abstract

Section: Automation Of Experimentsmentioning

confidence: 99%

“…However, more complex and detailed examples can be found in the work of da Silva. 11 The examples shown there explicitly use agent and environment models to generate M , whose formalisms are out of the scope of the present work, but can be found partly in da Silva and de Melo 33,34 .…”

Section: Another Examplementioning

confidence: 99%