Abstract

During the last years it has been widely recognized that formal semanticframeworks improve the capability to represent cognitive processes. In thisline, process algebras have been introduced as formal frameworks to representthis kind of processes. In this paper we compare two process algebras orientedtowards the specification of cognitive processes: RTPA (Real Time Process Algebra)and STOPA (Stochastic Process Algebra). These two formal languages sharea common characteristic: Both of them include a notion of time. Thus, whencomparing the two languages we will concentrate on the different treatment oftime. In order to illustrate how these two languages work we specify a cognitivemodel of the memorizing process both in RTPA and in STOPA. In order to representthe memory, we follow the classical memory classification (sensory buffer,short-term, and long-term memories) where we also consider the so-called actionbuffer memory.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.