We give a probabilistic characterization of the ideals of resolvent algebras. Through the correspondence of Klein and Landau between KMS systems and stochastic processes, the fields of an isotropic subspace become commuting random variables, and the description of ideals by subspaces of the one-particle space becomes a description by
σ-algebras: the ideal generated by the resolvents outside a subspace
Y corresponds to the
σ-algebra of the fields on
Y, inclusions of the ideals reverse those of the
σ-algebras, and independence is characterized by conditional expectations.
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP,
πtc to
π calculus, APPTC to probabilistic process algebra. And we also did some work on reversible process algebra and probabilistic truly concurrent process algebra. In this book, we utilize reversible truly concurrent process algebras APRTC and probabilistic process algebra APPTC to model quantum computing and unify quantum and classical computing.