Skip to main content
SpringerLink
Log in

A Comparative Study of STOPA and RTPA

  • Chapter
Transactions on Computational Science II

Part of the book series: Lecture Notes in Computer Science ((TCOMPUTATSCIE,volume 5150))

Abstract

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

Research partially supported by the Spanish MCYT project WEST TIN2006-15578-C02.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baeten, J.C.M., Middelburg, C.A.: Process algebra with timing. EATCS Monograph. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  2. Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Computer Science 18. Cambridge University Press, Cambridge (1990)

    Book  MATH  Google Scholar 

  3. Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. North Holland, Amsterdam (2001)

    MATH  Google Scholar 

  4. Bernardo, M., Gorrieri, R.: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science 202(1-2), 1–54 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bravetti, M., Bernardo, M., Gorrieri, R.: Towards performance evaluation with general distributions in process algebras. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 405–422. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Bravetti, M., Gorrieri, R.: The theory of interactive generalized semi-Markov processes. Theoretical Computer Science 282(1), 5–32 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L., Pardo, J.J.: Algebraic theory of probabilistic and non-deterministic processes. Journal of Logic and Algebraic Programming 55(1–2), 57–103 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cleaveland, R., Dayar, Z., Smolka, S.A., Yuen, S.: Testing preorders for probabilistic processes. Information and Computation 154(2), 93–148 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. D’Argenio, P.R., Katoen, J.-P., Brinksma, E.: An algebraic approach to the specification of stochastic systems. In: Programming Concepts and Methods, pp. 126–147. Chapman & Hall, Boca Raton (1998)

    Google Scholar 

  10. Davies, J., Schneider, S.: A brief history of timed CSP. Theoretical Computer Science 138, 243–271 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. van Glabbeek, R., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation 121(1), 59–80 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Götz, N., Herzog, U., Rettelbach, M.: Multiprocessor and distributed system design: The integration of functional specification and performance analysis using stochastic process algebras. In: Donatiello, L., Nelson, R. (eds.) SIGMETRICS 1993 and Performance 1993. LNCS, vol. 729, pp. 121–146. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  13. Harrison, P.G., Strulo, B.: SPADES – a process algebra for discrete event simulation. Journal of Logic Computation 10(1), 3–42 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  15. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  16. López, N., Núñez, M.: A testing theory for generally distributed stochastic processes. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 321–335. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. López, N., Núñez, M., Pelayo, F.L.: STOPA: A STOchastic Process Algebra for the formal representation of cognitive systems. In: 3rd IEEE Int. Conf. on Cognitive Informatics, ICCI 2004, pp. 64–73. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  18. López, N., Núñez, M., Pelayo, F.L.: Specifying the memorization process with STOPA. The International Journal of Cognitive Informatics & Natural Intelligence 1(4), 47–60 (2007)

    Article  Google Scholar 

  19. López, N., Núñez, M., Rodríguez, I., Rubio, F.: A formal framework for e-barter based on microeconomic theory and process algebras. In: Unger, H., Böhme, T., Mikler, A.R. (eds.) IICS 2002. LNCS, vol. 2346, pp. 217–228. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. López, N., Núñez, M., Rubio, F.: An integrated framework for the analysis of asynchronous communicating stochastic processes. Formal Aspects of Computing 16(3), 238–262 (2004)

    Article  MATH  Google Scholar 

  21. Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  22. Nicollin, X., Sifakis, J.: An overview and synthesis on timed process algebras. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 376–398. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  23. Núñez, M.: Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming 56(1–2), 117–177 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  24. Núñez, M., de Frutos, D.: Testing semantics for probabilistic LOTOS. In: 8th IFIP WG6.1 Int. Conf. on Formal Description Techniques, FORTE 1995, pp. 365–380. Chapman & Hall, Boca Raton (1996)

    Google Scholar 

  25. Núñez, M., de Frutos, D., Llana, L.: Acceptance trees for probabilistic processes. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 249–263. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  26. Núñez, M., Rodríguez, I.: PAMR: A process algebra for the management of resources in concurrent systems. In: 21st IFIP WG 6.1 Int. Conf. on Formal Techniques for Networked and Distributed Systems, FORTE 2001, pp. 169–185. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  27. Núñez, M., Rodríguez, I., Rubio, F.: Formal specification of multi-agent e-barter systems. Science of Computer Programming 57(2), 187–216 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  28. Pelayo, F.L., Cuartero, F., Valero, V., Cazorla, D.: An example of performance evaluation by using the stochastic process algebra ROSA. In: 7th Int. Conf. on Real-Time Systems and Applications, pp. 271–278. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  29. Pelayo, F.L., Núñez, M., López, N.: Specifying the memorization process with STOPA. In: 4th IEEE Int. Conf. on Cognitive Informatics, ICCI 2005, pp. 238–247. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  30. Plotkin, G.D.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department. Aarhus University (1981)

    Google Scholar 

  31. Reed, G.M., Roscoe, A.W.: A timed model for communicating sequential processes. Theoretical Computer Science 58, 249–261 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  32. Solso, R.L. (ed.): Mind and brain science in the 21st century. MIT Press, Cambridge (1999)

    Google Scholar 

  33. Squire, L.R., Knowlton, B., Musen, G.: The structure and organization of memory. Annual Review of Psychology 44, 453–459 (1993)

    Article  Google Scholar 

  34. Wang, Y.: On cognitive informatics. In: 1st IEEE Int. Conf. on Cognitive Informatics, ICCI 2002, pp. 34–42. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  35. Wang, Y.: The Real Time Process Algebra (RTPA). Annals of Software Engineering 14, 235–274 (2002)

    Article  MATH  Google Scholar 

  36. Wang, Y.: Cognitive informatics: A new transdisciplinary research field. Brain and Mind 4, 115–127 (2003)

    Article  Google Scholar 

  37. Wang, Y.: Using process algebra to describe human and software behaviors. Brain and Mind 4, 199–213 (2003)

    Article  Google Scholar 

  38. Wang, Y.: On the mathematical laws of software. In: 18th Canadian Conf. on Electrical and Computer Engineering, CCECE 2005, pp. 1086–1089 (2005)

    Google Scholar 

  39. Wang, Y.: Formal description of the cognitive process of memorization. In: 6th IEEE Int. Conf. on Cognitive Informatics, ICCI 2007, pp. 284–293. IEEE Computer Society Press, Los Alamitos (2007)

    Google Scholar 

  40. Wang, Y.: A software science perspective, crc book series in software engineering. Sofware Engineering Foundations 2 (2007)

    Google Scholar 

  41. Wang, Y.: The theoretical framework of cognitive informatics. The International Journal of Cognitive Informatics & Natural Intelligence 1(1), 1–27 (2007)

    Article  MathSciNet  Google Scholar 

  42. Wang, Y.: Deductive semantics of rtpa. The International Journal of Cognitive Informatics and Natural Intelligence 2(2), 95–121 (2008)

    Article  Google Scholar 

  43. Wang, Y.: A denotational mathematics for manipulating intelligent and computational behaviours. The International Journal of Cognitive Informatics and Natural Intelligence 2(2), 44–62 (2008)

    Article  Google Scholar 

  44. Wang, Y., Dong, L., Ruhe, G.: Formal description of the cognitive process of decision making. In: 3rd IEEE Int. Conf. on Cognitive Informatics, ICCI 2004, pp. 124–130. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  45. Wang, Y., Wang, Y.: Cognitive models of the brain. In: 1st IEEE Int. Conf. on Cognitive Informatics, ICCI 2002, pp. 259–269. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  46. Wang, Y., Wang, Y.: Recent advances in cognitive informatics. IEEE Transactions on Systems, Man, and Cybernetics C 36(2), 121–123 (2006)

    Article  MathSciNet  Google Scholar 

  47. Yi, W.: CCS+ Time = an interleaving model for real time systems. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 217–228. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Sistemas Informáticos y Programación Facultad de Informática, Universidad Complutense de Madrid, 28040, Madrid, Spain

    Natalia Lopez & Manuel Núñez

  2. Dept. de Sistemas Informáticos Escuela Politécnica Superior, Universidad Castilla-La Mancha, 02071, Albacete, Spain

    Fernando L. Pelayo

Authors
  1. Natalia Lopez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manuel Núñez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernando L. Pelayo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., Calgary, T2N 1N4, AB, Canada

    Marina L. Gavrilova

  2. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  3. Schulich School of Engineering, Department of Electrical and Computer Engineering, University of Calgary, 2500 University Drive, T2N 1N4, NW Calgary, AB, Canada

    Yingxu Wang

  4. Department of Computer Science, University of Regina, S4S 0A2, Regina, Saskatchewan, Canada

    Yiyu Yao

  5. School of Information Science & Technology, Southwest Jiaotong University, 610031, Chengdu, China

    Guoyin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Lopez, N., Núñez, M., Pelayo, F.L. (2008). A Comparative Study of STOPA and RTPA . In: Gavrilova, M.L., Tan, C.J.K., Wang, Y., Yao, Y., Wang, G. (eds) Transactions on Computational Science II. Lecture Notes in Computer Science, vol 5150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87563-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87563-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87562-8

  • Online ISBN: 978-3-540-87563-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation