Petri nets, hypergraphs and conflicts (preliminary version) View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1993

AUTHORS

Paola Alimonti , Esteban Feuerstein

ABSTRACT

We have extended the domain of application of previously known algorithms based on the representation of Petri nets as hypergraphs and graphs. In contrast to the class of conflict-free Petri nets the classes we consider are of practical interest, as they include nets representing systems that can be described with the linguistic constructs of many well known parallel languages. As open questions we can mention the possibility of extending the algorithm for boundedness to SPNCF Petri nets and further enlarge the class of nets for which this problem and those of potential firability and liveness can be efficiently solved, using the representations of Petri nets as hypergraphs and graphs. At present we are working on these issues. More... »

PAGES

293-309

Book

TITLE

Graph-Theoretic Concepts in Computer Science

ISBN

978-3-540-56402-7
978-3-540-47554-5

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-56402-0_55

DOI

http://dx.doi.org/10.1007/3-540-56402-0_55

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1024682488


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

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/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Sapienza University of Rome", 
          "id": "https://www.grid.ac/institutes/grid.7841.a", 
          "name": [
            "Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, via Salaria 113, I-00198\u00a0Roma, Italia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Alimonti", 
        "givenName": "Paola", 
        "id": "sg:person.015632520461.69", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015632520461.69"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Sapienza University of Rome", 
          "id": "https://www.grid.ac/institutes/grid.7841.a", 
          "name": [
            "Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, via Salaria 113, I-00198\u00a0Roma, Italia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Feuerstein", 
        "givenName": "Esteban", 
        "id": "sg:person.015027130655.34", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015027130655.34"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1993", 
    "datePublishedReg": "1993-01-01", 
    "description": "We have extended the domain of application of previously known algorithms based on the representation of Petri nets as hypergraphs and graphs. In contrast to the class of conflict-free Petri nets the classes we consider are of practical interest, as they include nets representing systems that can be described with the linguistic constructs of many well known parallel languages. As open questions we can mention the possibility of extending the algorithm for boundedness to SPNCF Petri nets and further enlarge the class of nets for which this problem and those of potential firability and liveness can be efficiently solved, using the representations of Petri nets as hypergraphs and graphs. At present we are working on these issues.", 
    "editor": [
      {
        "familyName": "Mayr", 
        "givenName": "Ernst W.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-56402-0_55", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-56402-7", 
        "978-3-540-47554-5"
      ], 
      "name": "Graph-Theoretic Concepts in Computer Science", 
      "type": "Book"
    }, 
    "name": "Petri nets, hypergraphs and conflicts (preliminary version)", 
    "pagination": "293-309", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-56402-0_55"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "759688d0450bd6f27df336ff8fb5d35c8f17463dee2a76e19b375868a098c8dc"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1024682488"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-56402-0_55", 
      "https://app.dimensions.ai/details/publication/pub.1024682488"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T17:57", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8681_00000042.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/3-540-56402-0_55"
  }
]
 

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

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-56402-0_55'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-56402-0_55'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-56402-0_55'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-56402-0_55'


 

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

72 TRIPLES      22 PREDICATES      27 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-56402-0_55 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N48a4121d66da4bc5ab820a042d71b07e
4 schema:datePublished 1993
5 schema:datePublishedReg 1993-01-01
6 schema:description We have extended the domain of application of previously known algorithms based on the representation of Petri nets as hypergraphs and graphs. In contrast to the class of conflict-free Petri nets the classes we consider are of practical interest, as they include nets representing systems that can be described with the linguistic constructs of many well known parallel languages. As open questions we can mention the possibility of extending the algorithm for boundedness to SPNCF Petri nets and further enlarge the class of nets for which this problem and those of potential firability and liveness can be efficiently solved, using the representations of Petri nets as hypergraphs and graphs. At present we are working on these issues.
7 schema:editor N0b67edb857814b758a169e941f3c7dc8
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Nadd167cb1f9947c6a9c641db979f9b83
12 schema:name Petri nets, hypergraphs and conflicts (preliminary version)
13 schema:pagination 293-309
14 schema:productId N5aec3596b46e44d98a423ae409d5cc05
15 Nb53e62fb25444951aae181ccbc685ded
16 Nc9ce811585674adf9c286666c5447b82
17 schema:publisher N97955ed0bd1e4381af66763f5c83b8d7
18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024682488
19 https://doi.org/10.1007/3-540-56402-0_55
20 schema:sdDatePublished 2019-04-15T17:57
21 schema:sdLicense https://scigraph.springernature.com/explorer/license/
22 schema:sdPublisher N3bf0cc1107ae42109d2660acb9d235b2
23 schema:url http://link.springer.com/10.1007/3-540-56402-0_55
24 sgo:license sg:explorer/license/
25 sgo:sdDataset chapters
26 rdf:type schema:Chapter
27 N0b67edb857814b758a169e941f3c7dc8 rdf:first N814b87c1da804679ab4381f12acd01d0
28 rdf:rest rdf:nil
29 N17a8bb448fab4c4c84ba35ea434c8697 rdf:first sg:person.015027130655.34
30 rdf:rest rdf:nil
31 N3bf0cc1107ae42109d2660acb9d235b2 schema:name Springer Nature - SN SciGraph project
32 rdf:type schema:Organization
33 N48a4121d66da4bc5ab820a042d71b07e rdf:first sg:person.015632520461.69
34 rdf:rest N17a8bb448fab4c4c84ba35ea434c8697
35 N5aec3596b46e44d98a423ae409d5cc05 schema:name dimensions_id
36 schema:value pub.1024682488
37 rdf:type schema:PropertyValue
38 N814b87c1da804679ab4381f12acd01d0 schema:familyName Mayr
39 schema:givenName Ernst W.
40 rdf:type schema:Person
41 N97955ed0bd1e4381af66763f5c83b8d7 schema:location Berlin, Heidelberg
42 schema:name Springer Berlin Heidelberg
43 rdf:type schema:Organisation
44 Nadd167cb1f9947c6a9c641db979f9b83 schema:isbn 978-3-540-47554-5
45 978-3-540-56402-7
46 schema:name Graph-Theoretic Concepts in Computer Science
47 rdf:type schema:Book
48 Nb53e62fb25444951aae181ccbc685ded schema:name readcube_id
49 schema:value 759688d0450bd6f27df336ff8fb5d35c8f17463dee2a76e19b375868a098c8dc
50 rdf:type schema:PropertyValue
51 Nc9ce811585674adf9c286666c5447b82 schema:name doi
52 schema:value 10.1007/3-540-56402-0_55
53 rdf:type schema:PropertyValue
54 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
55 schema:name Information and Computing Sciences
56 rdf:type schema:DefinedTerm
57 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
58 schema:name Artificial Intelligence and Image Processing
59 rdf:type schema:DefinedTerm
60 sg:person.015027130655.34 schema:affiliation https://www.grid.ac/institutes/grid.7841.a
61 schema:familyName Feuerstein
62 schema:givenName Esteban
63 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015027130655.34
64 rdf:type schema:Person
65 sg:person.015632520461.69 schema:affiliation https://www.grid.ac/institutes/grid.7841.a
66 schema:familyName Alimonti
67 schema:givenName Paola
68 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015632520461.69
69 rdf:type schema:Person
70 https://www.grid.ac/institutes/grid.7841.a schema:alternateName Sapienza University of Rome
71 schema:name Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, I-00198 Roma, Italia
72 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...