JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, Swansea University, Singleton Park, SA2 8PP, Sketty, Swansea, UK", 
          "id": "http://www.grid.ac/institutes/grid.4827.9", 
          "name": [
            "Department of Computer Science, Swansea University, Singleton Park, SA2 8PP, Sketty, Swansea, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Harwood", 
        "givenName": "Will", 
        "id": "sg:person.012570304207.93", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012570304207.93"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, Swansea University, Singleton Park, SA2 8PP, Sketty, Swansea, UK", 
          "id": "http://www.grid.ac/institutes/grid.4827.9", 
          "name": [
            "Department of Computer Science, Swansea University, Singleton Park, SA2 8PP, Sketty, Swansea, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Moller", 
        "givenName": "Faron", 
        "id": "sg:person.010425236217.29", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010425236217.29"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, Swansea University, Singleton Park, SA2 8PP, Sketty, Swansea, UK", 
          "id": "http://www.grid.ac/institutes/grid.4827.9", 
          "name": [
            "Department of Computer Science, Swansea University, Singleton Park, SA2 8PP, Sketty, Swansea, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Setzer", 
        "givenName": "Anton", 
        "id": "sg:person.016555714573.74", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016555714573.74"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2006", 
    "datePublishedReg": "2006-01-01", 
    "description": "Bisimilarity and weak bisimilarity \u2248 are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached \u2013 and even reached \u2013 by their (transfinite) inductively-defined approximants ~\u03b1 and \u2248\u03b1. For arbitrary processes this approximation may need to climb arbitrarily high through the infinite ordinals before stabilising. In this paper we consider a simple yet well-studied process algebra, the Basic Parallel Processes (BPP), and investigate for this class of processes the minimal ordinal \u03b1 such that \u2248 = \u2248\u03b1.The main tool in our investigation is a novel proof of Dickson\u2019s Lemma. Unlike classical proofs, the proof we provide gives rise to a tight ordinal bound, of \u03c9n, on the order type of non-increasing sequences of n-tuples of natural numbers. With this we are able to reduce a long-standing bound on the approximation hierarchy for weak bisimilarity \u2248 over BPP, and show that \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}${\\approx} = {\\approx_{\\omega^\\omega}}$\\end{document}.", 
    "editor": [
      {
        "familyName": "\u00c9sik", 
        "givenName": "Zolt\u00e1n", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11874683_24", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-45458-8", 
        "978-3-540-45459-5"
      ], 
      "name": "Computer Science Logic", 
      "type": "Book"
    }, 
    "keywords": [
      "class of processes", 
      "approximation hierarchy", 
      "Dickson\u2019s lemma", 
      "main tool", 
      "natural numbers", 
      "Basic Parallel Processes", 
      "ordinal \u03b1", 
      "lemma", 
      "order type", 
      "approximants", 
      "process algebra", 
      "classical proofs", 
      "arbitrary process", 
      "infinite ordinal", 
      "novel proof", 
      "canonical notion", 
      "algebra", 
      "proof", 
      "approximation", 
      "ordinal", 
      "non-increasing sequences", 
      "\u03c9n", 
      "bisimilarity", 
      "equivalence", 
      "class", 
      "tuples", 
      "weak bisimilarity", 
      "parallel processes", 
      "notion", 
      "process", 
      "hierarchy", 
      "number", 
      "tool", 
      "types", 
      "sequence", 
      "investigation", 
      "CO", 
      "standing", 
      "paper"
    ], 
    "name": "Weak Bisimulation Approximants", 
    "pagination": "365-379", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1040675574"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11874683_24"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11874683_24", 
      "https://app.dimensions.ai/details/publication/pub.1040675574"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:41", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_12.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/11874683_24"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

113 TRIPLES      23 PREDICATES      65 URIs      58 LITERALS      7 BLANK NODES