找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復制鏈接]
查看: 28958|回復: 58
樓主
發(fā)表于 2025-3-21 18:12:48 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Understanding Concurrent Systems
編輯A.W. Roscoe
視頻videohttp://file.papertrans.cn/942/941370/941370.mp4
概述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

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 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.
板凳
發(fā)表于 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.
地板
發(fā)表于 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.
5#
發(fā)表于 2025-3-22 09:59:24 | 只看該作者
6#
發(fā)表于 2025-3-22 14:55:59 | 只看該作者
7#
發(fā)表于 2025-3-22 19:50:07 | 只看該作者
8#
發(fā)表于 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
9#
發(fā)表于 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
10#
發(fā)表于 2025-3-23 07:18:29 | 只看該作者
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2026-1-25 12:17
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
日土县| 杨浦区| 延长县| 会昌县| 瓮安县| 健康| 连云港市| 运城市| 陵水| 沂水县| 蒙山县| 余庆县| 奈曼旗| 大足县| 顺义区| 武穴市| 福安市| 潍坊市| 乌兰浩特市| 东明县| 子长县| 安化县| 白银市| 明光市| 商南县| 凯里市| 潼关县| 龙泉市| 巴塘县| 循化| 北票市| 柘城县| 德化县| 巴东县| 桂平市| 南江县| 彭水| 旬阳县| 永兴县| 永新县| 罗甸县|