Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra. This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers

Computer science --- Machine theory --- Parallel processing (Electronic computers) --- Automates mathématiques, Théorie des --- Parallélisme (Informatique) --- Machine theory. --- High performance computing --- Multiprocessors --- Parallel programming (Computer science) --- Supercomputers --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics