Specifying the memorization process with STOPA

Authors:
F. L. Pelayo;M. Nunez;N. Lopez
Affiliations:
E. Politecnica Superior de Albacete, Univ. de Castilla-La Mancha, Albacete, Spain;Operations Res. Centre, Miguel Hernandez Univ. of Elche, Spain;Dept. of Comput. Sci., The Univ. of Calgary, Alta., Canada
Venue:
ICCI '05 Proceedings of the Fourth IEEE International Conference on Cognitive Informatics
Year:
2005

Citing 0
Cited 3

Testing Semantics for RTPA

Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
A comparative study of STOPA and RTPA

Transactions on computational science II
Testing Semantics for RTPA

Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we use the formal language STOPA for specifying cognitive systems. In addition to the usual characteristics of these formalisms, our language features the possibility of including stochastic time. This kind of time is useful to represent systems where the delays are not controlled by fix amounts of time, but they are given by a probability distribution function. In order to illustrate the usefulness of our formalism we will formally represent a cognitive model of the memory. Following contemporary theories of memory classification in Squire, L., et al, (1993) we consider sensory buffer, short-term, and long-term memories. Moreover, borrowing from Wang, Y. and Wang, Y., (2003), we also consider the so-called action buffer memory.