What is algebraic in process theory?

Electronic Notes in Theoretical Computer Science

Volumn 162, Issue 1, 2006, Pages 227-231

  Luttik, Bas ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

abstract algebra; process algebra; Process theory

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

ABSTRACT ALGEBRA; ABSTRACT ALGEBRAIC TREATMENT; PROCESS ALGEBRA; PROCESS THEORY;

LINEAR ALGEBRA;

EID: 33749077476     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.12.086     Document Type: Article

References (18)

1. Aceto, L., Some of my favourite results in classic process algebra, BRICS Report NS-03-2, BRICS, Department of Computer Science, Aalborg University (2003)
2. Baeten J.C.M. A brief history of process algebra. Theoret. Comput. Sci. 335 (2005) 131-146
3. Bergstra J.A., Fokkink W.J., and Ponse A. Process algebra with recursive operations. In: Bergstra J.A., Ponse A., and Smolka S.A. (Eds). Handbook of Process Algebra (2001), Elsevier Science Inc. 333-389
4. Bergstra, J.A. and J.W. Klop, Fixed point semantics in process algebra, Technical report IW 280, Mathematical Centre (1982)
5. Bergstra J.A., and Klop J.W. The algebra of recursively defined processes and the algebra of regular processes. In: Paredaens J. (Ed). Proceedings of ICALP'84. LNCS 172 (1984) 82-95
6. Bergstra J.A., and Klop J.W. Process algebra for synchronous communication. Information and Control 60 (1984) 109-137
7. Brookes S.D., Hoare C.A.R., and Roscoe A.W. A theory of communicating sequential processes. J. ACM 31 (1984) 560-599
8. Groote, J.F. and A. Ponse, The syntax and semantics of μCRL, in: A. Ponse, C. Verhoef and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes, Workshops in Computing (1994), pp. 26-62
9. Halmos P.R. The basic concepts of algebraic logic. American Mathematical Monthly 63 (1956) 363-387
10. Hennessy M., and Milner R. Algebraic laws for nondeterminism and concurrency. J. ACM 32 (1985) 137-161
11. Hoare C.A.R. Communicating sequential processes. Commun. ACM 21 (1978) 666-677
12. Hoare C.A.R. Communicating Sequential Processes. Series in Computer Science (1985), Prentice-Hall International, London
13. Luttik, B., "Choice Quantification in Process Algebra," Ph.D. thesis, University of Amsterdam (2002), available from http://www.win.tue.nl/~luttik
14. Luttik B., and van Oostrom V. Decomposition orders-another generalisation of the fundamental theorem of arithmetic. Theoret. Comput. Sci. 335 (2005) 147-186
15. Milner R. A Calculus of Communicating Systems. LNCS 92 (1980), Springer-Verlag, Berlin
16. Milner R. Communication and Concurrency (1989), Prentice-Hall International, Englewood Cliffs
17. Milner R., and Moller F. Unique decomposition of processes. Theoret. Comput. Sci. 107 (1993) 357-363
18. Moller, F., "Axioms for Concurrency," Ph.D. thesis, University of Edinburgh (1989)