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/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "CWI, Amsterdam", 
          "id": "http://www.grid.ac/institutes/grid.6054.7", 
          "name": [
            "CWI, Amsterdam"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Groote", 
        "givenName": "Jan Friso", 
        "id": "sg:person.010073156347.09", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010073156347.09"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept of Computer Science, University of Edinburgh, The King's Buildings, EH9 3JZ, Edinburgh, Scotland", 
          "id": "http://www.grid.ac/institutes/grid.4305.2", 
          "name": [
            "Dept of Computer Science, University of Edinburgh, The King's Buildings, EH9 3JZ, Edinburgh, Scotland"
          ], 
          "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": "1992", 
    "datePublishedReg": "1992-01-01", 
    "description": "Recently, Milner and Moller have presented several decomposition results for processes. Inspired by these, we investigate decomposition techniques for the verification of parallel systems. In particular, we consider those of the form p1\u2225p2\u2225 ...\u2225pm = q1 \u2225q2 \u2225...\u2225qn (*) where piand qj are (finite-) state systems, and \u2225denotes parallel composition. We provide a decomposition procedure for all pi and qj and give criteria that must be checked on the decomposed processes to see whether (*) does or does not hold. We analyse the complexity of our procedure and show that it is polynomial in n, m and the sizes of pi and qj if there is no communication. We also show that with communication the verification of (*) is co-NP hard, which makes it very unlikely that a polynomial complexity bound exists. But by applying our decomposition technique to Milner's cyclic scheduler we show that verification can become polynomial in space and time for practical examples, where standard techniques are exponential.", 
    "editor": [
      {
        "familyName": "Cleaveland", 
        "givenName": "W.R.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/bfb0084783", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-55822-4"
      ], 
      "name": "CONCUR '92", 
      "type": "Book"
    }, 
    "keywords": [
      "parallel systems", 
      "decomposition technique", 
      "polynomial complexity", 
      "parallel composition", 
      "verification", 
      "Co NPs", 
      "practical examples", 
      "complexity", 
      "communication", 
      "scheduler", 
      "system", 
      "technique", 
      "decomposition procedure", 
      "decomposition results", 
      "standard techniques", 
      "space", 
      "process", 
      "example", 
      "state system", 
      "decomposition", 
      "Milner", 
      "PI", 
      "time", 
      "procedure", 
      "results", 
      "criteria", 
      "size", 
      "exists", 
      "form", 
      "Moller", 
      "composition", 
      "Q1"
    ], 
    "name": "Verification of parallel systems via decomposition", 
    "pagination": "62-76", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1016206183"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bfb0084783"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/bfb0084783", 
      "https://app.dimensions.ai/details/publication/pub.1016206183"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:42", 
    "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_143.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/bfb0084783"
  }
]

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.

101 TRIPLES      23 PREDICATES      58 URIs      51 LITERALS      7 BLANK NODES