找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Understanding Concurrent Systems; A.W. Roscoe Textbook 2010 Springer-Verlag London Limited 2010 Notation.Variable.communicating sequential

[复制链接]
查看: 28816|回复: 58
发表于 2025-3-21 18:12:48 | 显示全部楼层 |阅读模式
书目名称Understanding Concurrent Systems
编辑A.W. Roscoe
视频video
概述Presents a comprehensive and up-to-date guide to the theory and practice of concurrency.Examines the ability of CSP to describe and enable reasoning about parallel systems modelled in other paradigms.
丛书名称Texts in Computer Science
图书封面Titlebook: Understanding Concurrent Systems;  A.W. Roscoe Textbook 2010 Springer-Verlag London Limited 2010 Notation.Variable.communicating sequential
描述CSP notation has been used extensively for teaching and applying concurrency theory, ever since the publication of the text Communicating Sequential Processes by C.A.R. Hoare in 1985. Both a programming language and a specification language, the theory of CSP helps users to understand concurrent systems, and to decide whether a program meets its specification. As a member of the family of process algebras, the concepts of communication and interaction are presented in an algebraic style.An invaluable reference on the state of the art in CSP, Understanding Concurrent Systems also serves as a comprehensive introduction to the field, in addition to providing material for a number of more advanced courses. A first point of reference for anyone wanting to use CSP or learn about its theory, the book also introduces other views of concurrency, using CSP to model and explain these. The text is fully integrated with CSP-based tools such as FDR, and describes how to create new tools based on FDR. Most of the book relies on no theoretical background other than a basic knowledge of sets and sequences. Sophisticated mathematical arguments are avoided whenever possible.Topics and features: prese
出版日期Textbook 2010
关键词Notation; Variable; communicating sequential process; communication; computer; concurrency; concurrency th
版次1
doihttps://doi.org/10.1007/978-1-84882-258-0
isbn_softcover978-1-4471-2600-3
isbn_ebook978-1-84882-258-0Series ISSN 1868-0941 Series E-ISSN 1868-095X
issn_series 1868-0941
copyrightSpringer-Verlag London Limited 2010
The information of publication is updating

书目名称Understanding Concurrent Systems影响因子(影响力)




书目名称Understanding Concurrent Systems影响因子(影响力)学科排名




书目名称Understanding Concurrent Systems网络公开度




书目名称Understanding Concurrent Systems网络公开度学科排名




书目名称Understanding Concurrent Systems被引频次




书目名称Understanding Concurrent Systems被引频次学科排名




书目名称Understanding Concurrent Systems年度引用




书目名称Understanding Concurrent Systems年度引用学科排名




书目名称Understanding Concurrent Systems读者反馈




书目名称Understanding Concurrent Systems读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:54:24 | 显示全部楼层
Hiding and Renaminga combination of parallel, hiding and renaming that makes constructing practical networks comparatively simple, and see how it can be used in building some natural dynamic networks such as one for implementing mergesort. We find that renaming can help FDR solve Sudoku puzzles faster.
发表于 2025-3-22 04:24:16 | 显示全部楼层
Using FDRiscuss the relative advantages of depth-first and breadth-first search, and finally show how compression operators that FDR supplies can enable one to (at least partially) overcome the state explosion problem that limits the size of systems the tool can handle.
发表于 2025-3-22 04:37:43 | 显示全部楼层
Operational Semantics in CSP. Combinators lead to Supercombinators, the technique that FDR uses to implement transition systems effectively. Finally we show how formal “observations” of transition systems allow us to deduce what a process’s traces, failures and divergences are.
发表于 2025-3-22 09:59:24 | 显示全部楼层
发表于 2025-3-22 14:55:59 | 显示全部楼层
发表于 2025-3-22 19:50:07 | 显示全部楼层
发表于 2025-3-23 00:57:02 | 显示全部楼层
CSP Case Studiesudoku puzzles in CSP and use FDR to solve them. The second shows how designing a routing network can easily lead to deadlock but how well designed networks can work reliably: we offer a number of alternatives for this in trees, general networks, rings and cartesian grids. The final example describes
发表于 2025-3-23 05:20:57 | 显示全部楼层
Hiding and Renamingle way of changing the labels on the events that a process communicates into different labels seen by the outside world. We see how hiding can create more natural models of parallel systems but can create a few theoretical difficulties, and how renaming combined with parallelism can create seemingly
发表于 2025-3-23 07:18:29 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-21 05:21
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表