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": "Department of Computer Science, University of Edinburgh, UK", 
          "id": "http://www.grid.ac/institutes/grid.4305.2", 
          "name": [
            "Department 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"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Edinburgh, UK", 
          "id": "http://www.grid.ac/institutes/grid.4305.2", 
          "name": [
            "Department of Computer Science, University of Edinburgh, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tofts", 
        "givenName": "Chris", 
        "id": "sg:person.012666473500.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012666473500.00"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1991", 
    "datePublishedReg": "1991-01-01", 
    "description": "In this paper, we consider the problem of defining a preorder on concurrent processes which will distinguish between functionally behaviourally equivalent processes which operate at different speeds. As our basic framework, we use a subset of the calculus TCCS of [Mol90], a language for describing concurrent processes involving timing constraints.There is an anomaly in timed process calculi such as TCCS which nullifies the possibility of defining such a preorder which is a precongruence. This anomaly arises due to the nature of the constructs in the calculus which force events to be executed without delay. To rectify this conflict, we define and motivate the above mentioned subcalculus, which we call \u2113TCCS (loose TCCS), and define our relation over this language. \u2113TCCS is precisely TCCS where all events may delay indefinitely before executing. We demonstrate why this is necessary in order for any sensible faster than relation to be a precongruence.Upon providing the semantic definition of our \u201cfaster than\u201d relation, we give results on the precongruicity of the relation and present a set of inequational laws.", 
    "editor": [
      {
        "familyName": "Baeten", 
        "givenName": "Jos C. M.", 
        "type": "Person"
      }, 
      {
        "familyName": "Groote", 
        "givenName": "Jan Frisco", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-54430-5_104", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-54430-2", 
        "978-3-540-38357-4"
      ], 
      "name": "CONCUR '91", 
      "type": "Book"
    }, 
    "keywords": [
      "language", 
      "constructs", 
      "relation", 
      "conflict", 
      "equivalent process", 
      "concurrent processes", 
      "process", 
      "events", 
      "speed", 
      "basic framework", 
      "different speeds", 
      "framework", 
      "nature", 
      "delay", 
      "problem", 
      "semantic definition", 
      "definition", 
      "results", 
      "set", 
      "possibility", 
      "respect", 
      "order", 
      "paper", 
      "subset", 
      "constraints", 
      "timing constraints", 
      "law", 
      "anomalies", 
      "calculus", 
      "preorder", 
      "process calculus", 
      "TCCS", 
      "timed process calculi", 
      "precongruence", 
      "subcalculus"
    ], 
    "name": "Relating processes with respect to speed", 
    "pagination": "424-438", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1009736593"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-54430-5_104"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-54430-5_104", 
      "https://app.dimensions.ai/details/publication/pub.1009736593"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:48", 
    "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_432.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-54430-5_104"
  }
]

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.

107 TRIPLES      23 PREDICATES      61 URIs      54 LITERALS      7 BLANK NODES