rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Directed Algebraic Topology and Concurrency
  name:
    name part: Fajstrup, Lisbeth.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Goubault, Eric.
    role:
      role term: author.
  name:
    name part: Haucourt, Emmanuel.
    role:
      role term: author.
  name:
    name part: Mimram, Samuel.
    role:
      role term: author.
  name:
    name part: Raussen, Martin.
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2016
    edition: 1st ed. 2016.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XI, 167 p. 1 illus. online resource.
  abstract: 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.
  table of contents: 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.\\.
  note: by Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raussen.
  subject:
    topic: Computer science
  subject:
    topic: Computers
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer mathematics
  subject:
    topic: Algebraic topology
  subject:
    topic: Complexity, Computational
  subject:
    topic: Computer Science
  subject:
    topic: Math Applications in Computer Science
  subject:
    topic: Algebraic Topology
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Complexity
  subject:
    topic: Computation by Abstract Devices
  subject:
    topic: Mathematical Applications in Computer Science
  classification: QA76.9.M35
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  identifier: 9783319153988
  identifier: http://dx.doi.org/10.1007/978-3-319-15398-8
  record info:
    record creation date: 160302
    record change date: 20170719142225.0
    record identifier: 978-3-319-15398-8