控制理论通常处理过程的动态行为，由微分方程来进行刻画。随着计算机控制的快速普及，出现了离散事件过程和混杂过程。离散事件过程可能是展现离散行为的最简单的过程。在离散事件系统中，状态是离散的，而且状态的转移仅仅是对离散事件的响应。在离散事件过程和计算过程之间存在微小的差异，即并行与并发，也就是说，对于多数的计算性质，如顺序、不确定性、递归和抽象等，它们是相同的。混杂理论是系统理论和计算机科学的结合体。在系统理论中，系统行为通常由微分方程来刻画，而在计算机科学中，系统行为通常由离散的原子动作及其之间的计算逻辑来刻画。在本书中，我们在真并发进程代数中引入离散事件系统和混杂系统，介绍了离散事件过程的公理化、分布式离散事件过程的公理化、混杂进程代数及其在神经网络建模中的应用以及具有位置的混杂进程代数及其在分布式/联邦神经网络建模中的应用等。

Chapter 1 Introduction
Chapter 2 Backgrounds
2.1 Operational Semantics
2.2 Proof Techniques
2.3 Truly Concurrent Process Algebra-APTC
2.3.1 Basic Algebra for True Concurrency
2.3.2 APTC with Left Parallel Composition
2.3.3 Recursion
2.3.4 Abstraction
2.3.5 Placeholder
2.3.6 Applications
2.4 Truly Concurrent Process Algebra with Localities
2.4.1 Operational Semantics with Localities
2.4.2 BATC with Localities
2.4.3 APTC with Localities
2.4.4 Recursion with Localities
2.4.5 Abstraction with Localities
Chapter 3 An Axiomatization of Discrete Event Processes
3.1 Basic Algebra for True Concurrency - BATC
3.1.1 Axiom System of BATC
3.1.2 Properties of BATC
3.1.3 Structured Operational Semantics of BATC
3.2 Algebra for Parallelism in True Concurrency
3.2.1 Parallelism as a Fundamental Computational Pattern
3.2.2 Axiom System of Parallelism
3.2.3 Properties of Parallelism
3.2.4 Structured Operational Semantics of Parallelism
3.2.5 Encapsulation
3.3 Recursion
3.3.1 Guarded Recursive Specifications
3.3.2 Recursive Definition and Specification Principles
3.3.3 Approximation Induction Principle
3.4 Silent Step and Abstraction
3.4.1 Guarded Linear Recursion
3.4.2 Algebraic Laws for the Silent Step
3.4.3 Abstraction
Chapter 4 An Axiomatization of Distributed Discrete Event Processes
4.1 BATC with Static Localities
4.1.1 Axiom System of BATC with Static Localities
4.1.2 Properties of BATC with Static Localities
4.1.3 Structured Operational Semantics of BATC with Static Localities
4.2 APTC with Static Localities
4.2.1 Properties of Parallelism with Static Localities
4.2.2 Structured Operational Semantics of Parallelism with Static Localities
4.2.3 Encapsulation with Static Localities
4.3 Recursion with Static Localities
4.3.1 Guarded Recursive Specifications with Static Localities
4.3.2 Recursive Definition and Specification Principles with Static Localities
4.3.3 Approximation Induction Principle with Static Localities
4.4 Silent Step and Abstraction with Static Localities
4.4.1 Guarded Linear Recursion with Static Localities
4.4.2 Algebraic Laws for the Silent Step with Static Localities
4.4.3 Abstraction with Static Localities
Chapter 5 Hybrid Process Algebra
5.1 Truly Concurrent Semantics
5.2 Hybrid BATC
5.2.1 Axiom System of Hybrid BATC
5.2.2 Properties of Hybrid BATC
5.2.3 Structured Operational Semantics of Hybrid BATC
5.3 Hybrid APTC
5.3.1 Properties of Parallelism of Hybrid APTC
5.3.2 Structured Operational Semantics of Parallelism of Hybrid APTC
5.3.3 Encapsulation of Hybrid APTC
5.4 Recursion of Hybrid APTC
5.4.1 Guarded Recursive Specifications
5.4.2 Recursive Definition and Specification Principles of Hybrid APTC
5.4.3 Approximation Induction Principle of Hybrid APTC
5.5 Silent Step and Abstraction of Hybrid APTC
5.5.1 Guarded Linear Recursion of Hybrid APTC
5.5.2 Algebraic Laws for the Silent Step of Hybrid APTC
5.5.3 Abstraction
5.6 Application of Hybrid APTC in Modeling Neural Networks
5.6.1 Modeling of Neurons
5.6.2 Modeling of Neural Networks
Chapter 6 Hybrid Process Algebra with Localities
6.1 Locality Semantics
6.2 Hybrid BATC with Localities
6.2.1 Axiom System of Hybrid BATC with Localities
6.2.2 Properties of Hybrid BATC With Localities
6.2.3 Structured Operational Semantics of Hybrid BATC with Localities
6.3 Hybrid APTC with Localities
6.3.1 Properties of Parallelism of Hybrid APTC with Localities
6.3.2 Structured Operational Semantics of Parallelism of Hybrid APTC with Localities
6.3.3 Encapsulation of Hybrid APTC with Localities
6.4 Recursion of Hybrid APTC with Localities
6.4.1