E-bok
PDF, Engelska, 20251 435 kr
Läs direkt efter köp
Samuel Mimram – författare
Visar alla böcker från författaren Samuel Mimram. Handla med fri frakt och snabb leverans.
5 produkter
5 produkter
- Del 495 - London Mathematical Society Lecture Note Series
Polygraphs: From Rewriting to Higher Categories
Häftad, Engelska, 20251 227 kr
Skickas inom 5-8 vardagar
This is the first book to revisit the theory of rewriting in the context of strict higher categories, through the unified approach provided by polygraphs, and put it in the context of homotopical algebra. The first half explores the theory of polygraphs in low dimensions and its applications to the computation of the coherence of algebraic structures. Illustrated with algorithmic computations on algebraic structures, the only prerequisite in this section is basic category theory. The theory is introduced step-by-step, with detailed proofs. The second half introduces and studies the general notion of n-polygraph, before addressing the homotopy theory of these polygraphs. It constructs the folk model structure on the category on strict higher categories and exhibits polygraphs as cofibrant objects. This allows the formulation of higher-dimensional generalizations of the coherence results developed in the first half. Graduate students and researchers in mathematics and computer science will find this work invaluable. - Inbunden, Engelska, 2016
1 113 kr
Skickas inom 10-15 vardagar
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 topologyhave 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. - E-bokPDF, Engelska, 2016
1 413 kr
Läs direkt efter köp
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 topologyhave 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.
- Häftad, Engelska, 2018
1 113 kr
Skickas inom 10-15 vardagar
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 topologyhave 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.
