Using Process Algebra to Describe Human and Software Behaviors
 Yingxu Wang
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Although there are various ways to express actions and behaviors in natural languages, it is found in cognitive informatics that human and system behaviors may be classified into three basic categories: to be, to have, and to do. All mathematical means and forms, in general, are an abstract description of these three categories of system behaviors and their common rules. Taking this view, mathematical logic may be perceived as the abstract means for describing ‘to be,’ set theory for describing 'to have,' and algebras, particularly the process algebra, for describing ‘to do.’ This is a fundamental view toward the formal description and modeling of human and system behaviors in general, and software behaviors in particular, because a software system can be perceived as a virtual agent of human beings, and it is created to do something repeatable, to extend human capability, reachability, and/or memory capacity. The author found that both human and software behaviors can be described by a threedimensional representative model comprising action, time, and space. For software system behaviors, the three dimensions are known as mathematical operations, event/process timing, and memory manipulation. This paper introduces the realtime process algebra (RTPA) that serves as an expressive notation system for describing thoughts and notions of dynamic software behaviors. Experimental case studies on applications of RTPA in describing the equivalent software and human behaviors as a series of actions and cognitive processes are demonstrated with realworld examples.
 Baeten, J. C. M. and Bergstra, J. A., 1991: Real time process algebra, Formal Aspects Comput. 3, 142188.
 Cerone, A., 2000: Process Algebra Versus Axiomatic Specification of a RealTime Protocol, Vol. 1816, LNCS, SpringerVerlag, Berlin, pp. 5767.
 Derrick, J. and Boiten, E., 2001: Refinement in Z and ObjectZ: Foundations and Advanced Applications, SpringerVerlag, London.
 Dierks, H., 2000: A Process Algebra for RealTime Programs, Vol. 1783, LNCS, Springer, Berlin, pp. 6676.
 Fecher, H., 2001:Arealtime process algebra with open intervals and maximal progress, Nordic Journal of Comput. 8(3), 346360.
 Gafurov, D. and Wang, Y., 2003: Formal description of the cognitive comprehension process, in Proc.2003 Canadian Conference on Electrical and Computer Engineering (CCECE'03), Montreal, Canada, May 2003, 35, pp. 14.
 Gerber, R., Gunter, E. L. and Lee, I., 1992: Implementing a realtime process algebra, in M. Archer, J. J. Joyce, K. N. Levitt and Phillip J. Windley (eds.), Proc.International Workshop on the Theorem Proving System and Its Applications, IEEE Computer Society Press, Los Alamitos, CA, August 1992, pp. 144154.
 Hoare, C. A. R., 1985: Communicating Sequential Processes, PrenticeHall, Englewood Cliffs, NJ. (ISBN 0131532718)
 Jeffrey, A., 1992: Translating timed process algebra into prioritized process algebra, in J. Vytopil (ed.), Proc.2nd International Symposium on Formal Techniques in RealTime and FaultTolerant Systems, Vol. 571, LNCS, SpringerVerlag, Nijmegen, The Netherlands, pp. 493506.
 Klusener, A. S., 1992: Abstraction in real time process algebra, in J. W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg (eds.), Proc.RealTime: Theory in Practice, LNCS, SpringerVerlag, Berlin, pp. 325352.
 MartinLof, P., 1975: An intuitionist theory of types: Predicative part, in H. Rose and J.C. Shepherdson (eds.), Logic Colloquium, NorthHolland, Amsterdam, pp. 73118.
 Milner, R., 1989: Communication and Concurrency, PrenticeHall, Englewood Cliffs, NJ.
 Nicollin, X. and Sifakis, J., 1991: An overview and synthesis on timed process Algebras, in Proc.3rd International Computer Aided Verification Conference, Aalborg, Denmark, Springer Verlag, pp. 376398.
 Vereijken, J. J., 1995: A process algebra for hybrid systems, in A. Bouajjani and O. Maler (eds.), Proc.Second European Workshop on RealTime and Hybrid Systems, Grenoble, France, June 1995.
 Wang, Y., 2001: Formal description of the UML architecture and extendibility, Int.J.Object 6(4), 469488.
 Wang, Y., 2002a: The realtime process algebra (RTPA), Ann.Software Engineer. 14 (Oct.), 235274.
 Wang, Y., 2002b: A new math for software engineeringThe realtime process algebra (RTPA), Keynote Speech at The 2nd ASERC Workshop on Quantitative and Soft Computing Based Software Engineering (QSSE'02), Banff, Alberta, Canada, April 2002.
 Wang,Y., 2002c: On the informatics laws of software (Keynote lecture), in Proc.1st IEEE International Conference on Cognitive Informatics (ICCI'02), Calgary, Canada, IEEE CS Press, August 2002, pp. 132144.
 Wang,Y. and Foinjong, N. C., 2002: Formal specification of a realtime lift dispatching system, in Proc.2002 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE'02), Winnipeg, Manitoba, Canada, May 2002, pp. 669674.
 Wang, Y. and Foinjong, N. C., 2003: Formal specification of realtime operating systems using RTPA, in Proc. 2003 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE'03), Montreal, Canada, May 2003, 35, pp. 14.
 Wang, Y. and King, G., 2000: Software Engineering Processes: Principles and Applications, CRC Press, Boca Raton, FL, 752 pp.
 Title
 Using Process Algebra to Describe Human and Software Behaviors
 Journal

Brain and Mind
Volume 4, Issue 2 , pp 199213
 Cover Date
 20030801
 DOI
 10.1023/A:1025457612549
 Print ISSN
 13891987
 Online ISSN
 15733300
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 cognitive informatics
 dynamic behavior description
 notion of action process algebra
 RTPA
 Authors

 Yingxu Wang ^{(1)}
 Author Affiliations

 1. Theoretical and Empirical Software Engineering Research Center, Department of Electrical and Computer Engineering, University of Calgary, 2500 University Drive NW, Calgary, Alberta, Canada, T2N 1N4