大葉大學圖書館 |

Directed algebraic topology and concurrency[electronic resource] /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	004.0151
書名/作者:	Directed algebraic topology and concurrency/ by Lisbeth Fajstrup ... [et al.].
其他作者:	Fajstrup, Lisbeth.
出版者:	Cham : : Springer International Publishing :, 2016.
面頁冊數:	xi, 167 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Complexity.
標題:	Computation by Abstract Devices.
標題:	Mathematical Applications in Computer Science.
標題:	Computer multitasking - Mathematics.
標題:	Algebraic topology.
標題:	Computer Science.
標題:	Math Applications in Computer Science.
標題:	Algebraic Topology.
標題:	Mathematical Logic and Formal Languages.
ISBN:	9783319153988
ISBN:	9783319153971
摘要、提要註:	This monograph presents an application of concepts and methods from algebraic topology to models of concurrent processes in computer science and their analysis. Taking well-known discrete models for concurrent processes in resource management as a point of departure, the book goes on to refine combinatorial and topological models. In the process, it develops tools and invariants for the new discipline directed algebraic topology, which is driven by fundamental research interests as well as by applications, primarily in the static analysis of concurrent programs. The state space of a concurrent program is described as a higher-dimensional space, the topology of which encodes the essential properties of the system. In order to analyse all possible executions in the state space, more than "just" the topological properties have to be considered: Execution paths need to respect a partial order given by the time flow. As a result, tools and concepts from topology have to be extended to take privileged directions into account. The target audience for this book consists of graduate students, researchers and practitioners in the field, mathematicians and computer scientists alike.
電子資源:	http://dx.doi.org/10.1007/978-3-319-15398-8

Directed algebraic topology and concurrency[electronic resource] /
Directed algebraic topology and concurrency[electronic resource] /by Lisbeth Fajstrup ... [et al.]. - Cham :Springer International Publishing :2016. - xi, 167 p. :ill., digital ;24 cm.

This monograph presents an application of concepts and methods from algebraic topology to models of concurrent processes in computer science and their analysis. Taking well-known discrete models for concurrent processes in resource management as a point of departure, the book goes on to refine combinatorial and topological models. In the process, it develops tools and invariants for the new discipline directed algebraic topology, which is driven by fundamental research interests as well as by applications, primarily in the static analysis of concurrent programs. The state space of a concurrent program is described as a higher-dimensional space, the topology of which encodes the essential properties of the system. In order to analyse all possible executions in the state space, more than "just" the topological properties have to be considered: Execution paths need to respect a partial order given by the time flow. As a result, tools and concepts from topology have to be extended to take privileged directions into account. The target audience for this book consists of graduate students, researchers and practitioners in the field, mathematicians and computer scientists alike.

ISBN: 9783319153988

Standard No.: 10.1007/978-3-319-15398-8doiSubjects--Topical Terms:

464233
Complexity.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Directed algebraic topology and concurrency[electronic resource] /
LDR:02172nam a2200325 a 4500 001 446500
003 DE-He213
005 20160909171538.0
006 m d
007 cr nn 008maaau
008 161201s2016 gw s 0 eng d
020 $a 9783319153988 $q (electronic bk.)
020 $a 9783319153971 $q (paper)
024 7 $a 10.1007/978-3-319-15398-8 $2 doi
035 $a 978-3-319-15398-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35
072 7 $a UYAM $2 bicssc
072 7 $a UFM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a MAT003000 $2 bisacsh
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b D598 2016
245 0 0 $a Directed algebraic topology and concurrency $h [electronic resource] / $c by Lisbeth Fajstrup ... [et al.].
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xi, 167 p. : $b ill., digital ; $c 24 cm.
520 $a This monograph presents an application of concepts and methods from algebraic topology to models of concurrent processes in computer science and their analysis. Taking well-known discrete models for concurrent processes in resource management as a point of departure, the book goes on to refine combinatorial and topological models. In the process, it develops tools and invariants for the new discipline directed algebraic topology, which is driven by fundamental research interests as well as by applications, primarily in the static analysis of concurrent programs. The state space of a concurrent program is described as a higher-dimensional space, the topology of which encodes the essential properties of the system. In order to analyse all possible executions in the state space, more than "just" the topological properties have to be considered: Execution paths need to respect a partial order given by the time flow. As a result, tools and concepts from topology have to be extended to take privileged directions into account. The target audience for this book consists of graduate students, researchers and practitioners in the field, mathematicians and computer scientists alike.
650 2 4 $a Complexity. $3 464233
650 2 4 $a Computation by Abstract Devices. $3 463641
650 2 4 $a Mathematical Applications in Computer Science. $3 467521
650 0 $a Computer multitasking $x Mathematics. $3 639206
650 0 $a Algebraic topology. $3 555206
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Math Applications in Computer Science. $3 466204
650 2 4 $a Algebraic Topology. $3 464924
650 2 4 $a Mathematical Logic and Formal Languages. $3 463478
700 1 $a Fajstrup, Lisbeth. $3 639205
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-15398-8
950 $a Computer Science (Springer-11645)