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/17", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Psychology and Cognitive Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1701", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Psychology", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Laboratory for Foundations of Computer Science, University of Edinburgh, UK", 
          "id": "http://www.grid.ac/institutes/grid.4305.2", 
          "name": [
            "Laboratory for Foundations of Computer Science, University of Edinburgh, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Christensen", 
        "givenName": "S\u00f8ren", 
        "id": "sg:person.015333114643.59", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015333114643.59"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Laboratory for Foundations of Computer Science, University of Edinburgh, UK", 
          "id": "http://www.grid.ac/institutes/grid.4305.2", 
          "name": [
            "Laboratory for Foundations of Computer Science, University of Edinburgh, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hirshfeld", 
        "givenName": "Yoram", 
        "id": "sg:person.013456371571.52", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013456371571.52"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Laboratory for Foundations of Computer Science, University of Edinburgh, UK", 
          "id": "http://www.grid.ac/institutes/grid.4305.2", 
          "name": [
            "Laboratory for Foundations of Computer Science, University of Edinburgh, 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"
      }
    ], 
    "datePublished": "1993", 
    "datePublishedReg": "1993-01-01", 
    "description": "In a previous paper the authors proved the decidability of bisimulation equivalence over two subclasses of recursive processes involving a parallel composition operator, namely the so-called normed and live processes. In this paper, we extend this result to the whole class. The decidability proof permits us further to present a complete axiomatisation for this class of basic parallel processes. This result can be viewed as a proper extension of Milner's complete axiomatisation of bisimulation equivalence on regular processes.", 
    "editor": [
      {
        "familyName": "Best", 
        "givenName": "Eike", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-57208-2_11", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-57208-4", 
        "978-3-540-47968-0"
      ], 
      "name": "CONCUR'93", 
      "type": "Book"
    }, 
    "keywords": [
      "previous paper", 
      "process", 
      "authors", 
      "equivalence", 
      "subclasses", 
      "recursive process", 
      "operators", 
      "live processes", 
      "results", 
      "whole class", 
      "class", 
      "proof", 
      "parallel processes", 
      "proper extension", 
      "extension", 
      "regular process", 
      "paper", 
      "decidability", 
      "bisimulation equivalence", 
      "parallel composition operator", 
      "composition operators", 
      "decidability proof", 
      "complete axiomatisation", 
      "axiomatisation", 
      "Basic Parallel Processes"
    ], 
    "name": "Bisimulation equivalence is decidable for basic parallel processes", 
    "pagination": "143-157", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1040397596"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-57208-2_11"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-57208-2_11", 
      "https://app.dimensions.ai/details/publication/pub.1040397596"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:43", 
    "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_232.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-57208-2_11"
  }
]

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.

99 TRIPLES      23 PREDICATES      51 URIs      44 LITERALS      7 BLANK NODES