Yong Wang Knihy

The book delves into the integration of localities within truly concurrent process algebras, presenting innovative frameworks like Calculus for True Concurrency (CTC) and Algebra of Parallelism for True Concurrency (APTC). These frameworks extend traditional models to accommodate true concurrency concepts, focusing on various bisimilarities such as pomset, step, history-preserving, and hereditary history-preserving bisimilarity. This comprehensive exploration enhances the understanding of concurrency in process algebra, making it a valuable resource for researchers in the field.

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.