Algebraic Theory for True Concurrency

Focusing on algebraic laws for true concurrency, this book delves into the significant concepts of parallelism and concurrency in computer science. It discusses the decomposition of programs into order-independent components to enhance performance. The text contrasts interleaving concurrency, represented by bisimulation equivalences, with true concurrency, highlighting various bisimulation equivalences such as pomset and history-preserving bisimulation. This work lays the groundwork for a comprehensive axiomatization, contributing to ongoing research and applications in the field.