000			03494nam a22006255i 4500
001			978-3-319-15398-8
003			DE-He213
005			20200421112049.0
007			cr nn 008mamaa
008			160302s2016 gw | s |||| 0|eng d
020			_a9783319153988 _9978-3-319-15398-8
024	7		_a10.1007/978-3-319-15398-8 _2doi
050		4	_aQA76.9.M35
072		7	_aUYAM _2bicssc
072		7	_aUFM _2bicssc
072		7	_aCOM018000 _2bisacsh
072		7	_aMAT003000 _2bisacsh
082	0	4	_a004.0151 _223
100	1		_aFajstrup, Lisbeth. _eauthor.
245	1	0	_aDirected Algebraic Topology and Concurrency _h[electronic resource] / _cby Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raussen.
250			_a1st ed. 2016.
264		1	_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2016.
300			_aXI, 167 p. 1 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_a1 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			_aThis 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	_aComputer science.
650		0	_aComputers.
650		0	_aMathematical logic.
650		0	_aComputer science _xMathematics.
650		0	_aComputer mathematics.
650		0	_aAlgebraic topology.
650		0	_aComplexity, Computational.
650	1	4	_aComputer Science.
650	2	4	_aMath Applications in Computer Science.
650	2	4	_aAlgebraic Topology.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aComplexity.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aMathematical Applications in Computer Science.
700	1		_aGoubault, Eric. _eauthor.
700	1		_aHaucourt, Emmanuel. _eauthor.
700	1		_aMimram, Samuel. _eauthor.
700	1		_aRaussen, Martin. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783319153971
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-319-15398-8
912			_aZDB-2-SCS
942			_cEBK
999			_c57073 _d57073