新書推薦：
《
东法西渐：19世纪前西方对中国法的记述与评价
》
售價：HK$
201.6
《
养育男孩：官方升级版
》
售價：HK$
50.4
《
小原流花道技法教程
》
售價：HK$
109.8
《
少女映像室 唯美人像摄影从入门到实战
》
售價：HK$
110.9
《
詹姆斯·伍德系列：不负责任的自我：论笑与小说（“美国图书评论奖”入围作品 当代重要文学批评家詹姆斯·伍德对“文学中的笑与喜剧”的精湛研究）
》
售價：HK$
87.4
《
武当内家散手
》
售價：HK$
50.4
《
诛吕：“诸吕之乱”的真相与吕太后时期的权力结构
》
售價：HK$
99.7
《
炙野（全2册）
》
售價：HK$
78.2
|
| 內容簡介： |
随着计算机网络和通信技术的发展，对并发分布式系统的研究变得越来越重要。作为一种描述并发计算的模型，进程演算受到广泛研究并被成功应用到实际系统的规范、设计、分析及验证中。近些年来，人们提出概率进程演算用来描述和分析并发系统的量化行为，这要求对概率进程的语义基础进行深入研究。
在邓玉欣*作的《概率进程语义（英文版）》中，以操作语义的方式把进程行为表示成概率标号迁移系统。不同迁移系统通过一些适当的行为等价或前序关系进行比较。
|
| 目錄：
|
1 Introduction
1.1 Background
1.2 Synopsis
References
2 Mathematical Preliminaries
2.1 Lattice Theory
2.2 Induction and Coinduction
2.3 Topological Spaces
2.4 Metric Spaces
2.5 Probability Spaces
2.6 Linear Programming
References
3 Probabilistic Bisimulation
3.1 Introduction
3.2 Probabilistic Labelled Transition Systems
3.3 Lifting Relations
3.4 Justifving the Lifting Operation
3.4.1 Justification by the Kantorovich Memc
3.4.2 Justification by Network Flow
3.5 Probabilistic Bisimulation
3.6 Logical Characterisation
3.6.1 An Adequate Logic
3.6.2 An Expressive Logic
3.7 Metric Characterisation
3.8 Algorithmic Characterisation
3.8.1 A Partition Refinement Algorithm
3.8.2 An“On—the—Fly”Algorithm
3.9 Bibliographic Notes
3.9.1 Probabilistic Models
3.9.2 Probabilistic Bisimulation
References
4 Probabilistic Testine Semantics
4.1 A General Testing Framework
4.2 Testing Probabilistic Processes
4.3 Bounded Continuity
4.4 Reward Testing
4.4.1 A Geometric Property
4.4.2 Nonnegative Rewards
4.5 Extremal Reward Testing
4.6 Extremal Reward Testing Versus Resolution—Based Reward Testing
4.6.1 Must Testing
4.6.2 May Testing
4.7 Vector—Based Testing Versus Scalar Testin~
4.8 Bibliographic Notes
References
5 Testing Finite Probabilistic Processes
5.1 Introduction
5.2 The Language pCSP
5.2.1 The Syntax
5.2.2 The Operational Semantics
5.2.3 The Precedence of Probabilistic Choice
5.2.4 Graphical representation of pCSP processes
5.2.5 Testing pCSP Processes
5.3 Counterexamples
5.4 Must Versus May Testing
5.5 Forward and Failure Simulation
5.5.1 The Simulation Preorders
5.5.2 The Simulation Preorders are Precongruences
5.5.3 Simulations Are Sound for Testing Preorders
5.6 A Modal Logic
5.7 Characteristic Tests
5.8 Equational Theories
5.9 Inequational Theories
5.10 Comoletenes
5.11 Bibliographic Notes
5.11.1 Probabilistic Equivalences
5.11.2 Probabilistic Simulations
References
6 Testing Finitary Probabilistic Processes
6.1 IntrOduction
6.2 The Language rpCSP
6.3 A General Definition of Weak Derivations
6.3.1 Lifting Relations
6.3.2 Weak Transitions
6.3.3 Properties of Weak Transitions
6.4 Testing rpCSP Processes
6.4.1 Testing with Extremal Derivatives
6.4.2 Comparison with Resolution—Based Testing
6.5 Generatinz Weak Derivatives in a Finitary pLTS
6.5.1 Finite Generability
6.5.2 Realising Payoffs
6.5.3 Conseauences
6.6 The Failure Simulation Preorder
6.6.1 Two Equivalent Definitions and Their Rationale
6.6.2 A Simple Failure Similarity for Finitary Processes
6.6.3 Precongruence
6.6.4 Soundness
6.7 Failure Simulation is Complete for Must Testing
6.7.1 Inductive Characterisatior
6.7.2 The Modal Logic
6.7.3 Characteristic Tests for Formulae
6.8 Simulations and May Testing
6.8.1 Soundness
6.8.2 Completeness
6.9 Real—Reward Testing
6.10 Summary
References
7 Weak Probabilistic Bisimulation
7.1 Introduction
7.2 A Simple Bisimulation
7.3 Compositionality
7.4 Reduction Barbed Congruence
7.5 Bibliographic Notes
References
Index
|
|
購物車/收銀台(0) | 在線留言板
| 付款方式
| 運費計算
| 聯絡我們
| 幫助中心 |
加入書簽
HOME
新書上架
