离散与混杂控制的代数理论（英文版）

6.6.2　Modeling of Distributed/Federated Neural Networks

6.6.1　Modeling of Distributed/Federated Neurons

6.6　Application of Hybrid APTC with Localities in Modeling Distributed/Federated Neural Networks

6.5.3 Abstraction of Hybrid APTC with Localities

6.5.2　Algebraic Laws for the Silent Step of Hybrid APTC with Localities

6.5.1　Guarded Linear Recursion of Hybrid APTC with Localities

6.5　Silent Step and Abstraction of Hybrid APTC with Localities

6.4.3　Approximation Induction Principle of Hybrid APTC with Localities

6.4.2　Recursive Definition and Specification Principles of Hybrid APTC with Localities

6.4.1　Guarded Recursive Specifications of Hybrid APTC with Localities

6.4　Recursion of Hybrid APTC with Localities

6.3.3　Encapsu lation of Hybrid APTC with Localities

6.3.2　Structured Operational Semantics of Parallelism of Hybrid APTC with Localities

6.3.1　Properties of Parallelism of Hybrid APTC with Localities

6.3　Hybrid APTC with Localities

6.2.3　Structured Operational Semantics of Hybrid BATC with Localities

6.2.2　Properties of Hybrid BATC With Localities

6.2.1　Axiom System of Hybrid BATC with Localities

6.2　Hybrid BATC with Localities

6.1　Locality Semantics

Chapter 6　Hybrid Process Algebra with Localities

5.6.2　Modeling of Neural Networks

5.6.1　Modeling of Neurons

5.6　Application of Hybrid APTC in Modeling Neural Networks

5.5.3　Abstraction

5.5.2　Algebraic Laws for the Silent Step of Hybrid APTC

5.5.1　Guarded Linear Recursion of Hybrid APTC

5.5　Silent Step and Abstraction of Hybrid APTC

5.4.3　Approximation Induction Principle of Hybrid APTC

5.4.2　Recursive Definition and Specification Principles of Hybrid APTC

5.4.1　Guarded Recursive Specifications

5.4　Recursion of Hybrid APTC

5.3.3　Encapsulation of Hybrid APTC

5.3.2　Structured Operational Semantics of Parallelism of Hybrid APTC

5.3.1　Properties of Parallelism of Hybrid APTC

5.3　Hybrid APTC

5.2.3　Structured Operational Semantics of Hybrid BATC

5.2.2　Properties of Hybrid BATC

5.2.1　Axiom System of Hybrid BATC

5.2　Hybrid BATC

5.1　Truly Concurrent Semantics

Chapter 5　Hybrid Process Algebra

4.4.3　Abstraction with Static Localities

4.4.2　Algebraic Laws for the Silent Step with Static Localities

4.4.1　Guarded Linear Recursion with Static Localities

4.4　Silent Step and Abstraction with Static Localities

4.3.3　Approximation Induction Principle with Static Localities

4.3.2　Recursive Definition and Specification Principles with Static Localities

4.3.1　Guarded Recursive Specifications with Static Localities

4.3　Recursion with Static Localities

4.2.3　Encapsu lation with Static Localities

4.2.2　Structured Operational Semantics of Parallelism with Static Localities

4.2.1　Properties of Parallelism with Static Localities

4.2　APTC with Static Localities

4.1.3　Structured Operational Semantics of BATC with Static Localities

4.1.2　Properties of BATC with Static Localities

4.1.1　Axiom System of BATC with Static Localities

4.1　BATC with Static Localities

Chapter 4　An Axiomatization of Distributed Discrete Event Processes

3.4.3　Abstraction

3.4.2　Algebraic Laws for the Silent Step

3.4.1　Guarded Linear Recursion

3.4　Silent Step and Abstraction

3.3.3　Approximation Induction Principle

3.3.2　Recursive Definition and Specification Principles

3.3.1　Guarded Recursive Specifications

3.3　Recursion

3.2.5　Encapsulation

3.2.4　Structured Operational Semantics of Parallelism

3.2.3 Properties of Parallelism

3.2.2　Axiom System of Parallelism

3.2.1　Parallelism as a Fundamental Computational Pattern

3.2　Algebra for Parallelism in True Concurrency

3.1.3　Structured Operational Semantics of BATC

3.1.2　Properties of BATC

3.1.1　Axiom System of BATC

3.1　Basic Algebra for True Concurrency-BATC

Chapter 3　An Axiomatization of Discrete Event Processes

2.4.5　Abstraction with Localities

2.4.4　Recursion with Localities

2.4.3　APTC with Localities

2.4.2　BATC with Localities

2.4.1　Operational Semantics with Localities

2.4　Truly Concurrent Process Algebra with Localities

2.3.6　App lications

2.3.5　Placeholder

2.3.4　Abstraction

2.3.3　Recursion

2.3.2　APTC with Left Parallel Composition

2.3.1　Basic Algebra for True Concurrency

2.3　Truly Concurrent Process Algebra-APTC

2.2　Proof Techniques

2.1　Operational Semantics

Chapter 2　Backgrounds

Chapter 1　Introduction

版权信息

封面

封面

版权信息

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　App lications

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　Encapsu lation 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　Encapsu lation of Hybrid APTC with Localities

6.4　Recursion of Hybrid APTC with Localities

6.4.1　Guarded Recursive Specifications of Hybrid APTC with Localities

6.4.2　Recursive Definition and Specification Principles of Hybrid APTC with Localities

6.4.3　Approximation Induction Principle of Hybrid APTC with Localities

6.5　Silent Step and Abstraction of Hybrid APTC with Localities

6.5.1　Guarded Linear Recursion of Hybrid APTC with Localities

6.5.2　Algebraic Laws for the Silent Step of Hybrid APTC with Localities

6.5.3 Abstraction of Hybrid APTC with Localities

6.6　Application of Hybrid APTC with Localities in Modeling Distributed/Federated Neural Networks

6.6.1　Modeling of Distributed/Federated Neurons

6.6.2　Modeling of Distributed/Federated Neural Networks