國立虎尾科技大學 |

Directed Algebraic Topology and Concurrency

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Directed Algebraic Topology and Concurrency/ by Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raussen.
Author:	Fajstrup, Lisbeth.
other author:	Goubault, Eric.
Description:	XI, 167 p. 1 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science—Mathematics. -
Online resource:	https://doi.org/10.1007/978-3-319-15398-8
ISBN:	9783319153988

Directed Algebraic Topology and Concurrency
Fajstrup, Lisbeth.

Directed Algebraic Topology and Concurrency[electronic resource] /by Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raussen. - 1st ed. 2016. - XI, 167 p. 1 illus.online resource.

1 Introduction -- 2 A toy language for concurrency -- 3 Truly concurrent models of programs with resources -- 4 Directed topological models of concurrency -- 5 Algorithmics on directed spaces.\\.

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:

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Directed Algebraic Topology and Concurrency
LDR:02797nam a22004095i 4500 001 980177
003 DE-He213
005 20200703223218.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319153988 $9 978-3-319-15398-8
024 7 $a 10.1007/978-3-319-15398-8 $2 doi
035 $a 978-3-319-15398-8
050 4 $a QA76.9.M35
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
072 7 $a UFM $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Fajstrup, Lisbeth. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1106561
245 1 0 $a Directed Algebraic Topology and Concurrency $h [electronic resource] / $c by Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raussen.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XI, 167 p. 1 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 1 Introduction -- 2 A toy language for concurrency -- 3 Truly concurrent models of programs with resources -- 4 Directed topological models of concurrency -- 5 Algorithmics on directed spaces.\\.
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 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Algebraic topology. $3 678206
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Computational complexity. $3 527777
650 0 $a Computers. $3 565115
650 0 $a Computer mathematics. $3 1199796
650 1 4 $a Math Applications in Computer Science. $3 669887
650 2 4 $a Algebraic Topology. $3 672209
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Complexity. $3 669595
650 2 4 $a Computation by Abstract Devices. $3 669792
650 2 4 $a Mathematical Applications in Computer Science. $3 815331
700 1 $a Goubault, Eric. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1273058
700 1 $a Haucourt, Emmanuel. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1273059
700 1 $a Mimram, Samuel. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1273060
700 1 $a Raussen, Martin. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1273061
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319153971
776 0 8 $i Printed edition: $z 9783319153995
776 0 8 $i Printed edition: $z 9783319792170
856 4 0 $u https://doi.org/10.1007/978-3-319-15398-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)