A comparative study of STOPA and RTPA

Authors:
Natalia Lopez;Manuel Núñez;Fernando L. Pelayo
Affiliations:
Dept. Sistemas Informáticos y Programación, Facultad de Informática, Universidad Complutense de Madrid, Madrid, Spain;Dept. Sistemas Informáticos y Programación, Facultad de Informática, Universidad Complutense de Madrid, Madrid, Spain;Dept. de Sistemas Informáticos, Escuela Politécnica Superior, Universidad Castilla-La Mancha, Albacete, Spain
Venue:
Transactions on computational science II
Year:
2008

Citing 33
Cited 0

Communicating sequential processes

Communicating sequential processes
A timed model for communicating sequential processes

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Process algebra

Process algebra
A brief history of Timed CSP

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Reactive, generative, and stratified models of probabilistic processes

Information and Computation
A compositional approach to performance modelling

A compositional approach to performance modelling
A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time

Theoretical Computer Science
Testing preorders for probabilistic processes

Information and Computation
Communication and Concurrency

Communication and Concurrency
Handbook of Process Algebra

Handbook of Process Algebra
Process Algebra with Timing

Process Algebra with Timing
The theory of interactive generalized semi-Markov processes

Theoretical Computer Science
The Real-Time Process Algebra (RTPA)

Annals of Software Engineering
A Formal Framework for E-Barter Based on Microeconomic Theory and Process Algebras

IICS '02 Proceedings of the Second International Workshop on Innovative Internet Computing Systems
On the Informatics Laws of Software

ICCI '02 Proceedings of the 1st IEEE International Conference on Cognitive Informatics
On Cognitive Informatics

ICCI '02 Proceedings of the 1st IEEE International Conference on Cognitive Informatics
PAMR: A Process Algebra for the Management of Resources in Concurrent Systems

FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
CCS + Time = An Interleaving Model for Real Time Systems

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Towards Performance Evaluation with General Distributions in Process Algebras

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Acceptance Trees for Probabilistic Processes

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras

Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
An algebraic approach to the specification of stochastic systems

PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
An Overview and Synthesis on Timed Process Algebras

CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Cognitive Models of the Brain

ICCI '02 Proceedings of the 1st IEEE International Conference on Cognitive Informatics
An example of performance evaluation by using the stochastic process algebra: ROSA

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
An integrated framework for the performance analysis of asynchronous communicating stochastic processes

Formal Aspects of Computing
STOPA: A STOchastic Process Algebra for the Formal Representation of Cognitive Systems

ICCI '04 Proceedings of the Third IEEE International Conference on Cognitive Informatics
Formal Description of the Cognitive Process of Decision Making

ICCI '04 Proceedings of the Third IEEE International Conference on Cognitive Informatics
Formal specification of multi-agent e-barter systems

Science of Computer Programming
Specifying the memorization process with STOPA

ICCI '05 Proceedings of the Fourth IEEE International Conference on Cognitive Informatics
Formal Description of the Mechanisms and Cognitive Process of Memorization

COGINF '07 Proceedings of the 6th IEEE International Conference on Cognitive Informatics
Software Engineering Foundations: A Software Science Perspective

Software Engineering Foundations: A Software Science Perspective
Editorial Recent Advances in Cognitive Informatics

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

Quantified Score

Hi-index	0.00

Visualization

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.