Algebraic Theory for True Concurrency

Algebraic Theory for True Concurrency is a book that covers the algebraic laws for true concurrency, which is a core concept in computer science. It discusses the two primary approaches to executing concurrency: interleaving concurrency and true concurrency. True concurrency is an active area of research with many emerging applications, including several truly concurrent bisimulation equivalences.

Format: Paperback / softback
Length: 228 pages
Publication date: 01 January 2023
Publisher: Elsevier Science Publishing Co Inc

Algebraic Theory for True Concurrency delves into the intricate realm of algebraic laws governing true concurrency, a fundamental concept in computer science. Parallelism and concurrency are two core pillars that shape the landscape of computing. This comprehensive book explores the diverse aspects of concurrency, empowering programs, algorithms, and problems to be dissected into order-independent or partially ordered components, thereby enhancing computation and execution speed.

Two primary approaches exist for executing concurrency: interleaving concurrency and true concurrency. Interleaving concurrency, represented by bisimulation/rooted branching bisimulation equivalences, is a well-studied area, with this work ultimately leading to the development of the comprehensive axiomatization modulo bisimulation equivalence, known as ACP (Algebra of Communicating Processes).

On the other hand, true concurrency represents a dynamic and evolving field of research, encompassing a wide range of emerging applications. One notable aspect of true concurrency is the existence of several truly concurrent bisimulation equivalences. These equivalences include the pomset bisimulation equivalence, step bisimulation equivalence, history-preserving (hp-) bisimulation equivalence, and hereditary history-preserving (hhp-) bisimulation equivalence, among others. These equivalences hold significant importance in understanding and analyzing concurrent systems.

Algebraic Theory for True Concurrency serves as a valuable resource for researchers, practitioners, and students seeking to delve deeper into the complexities of concurrency and its algebraic foundations. By unraveling the algebraic laws governing true concurrency, this book provides a solid foundation for developing efficient and scalable concurrent systems that can handle the demands of modern computing.

Weight: 450g
Dimension: 235 x 191 (mm)
ISBN-13: 9780443189128