Checking regular properties of Petri nets View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1995

AUTHORS

Petr Jančar , Faron Moller

ABSTRACT

In this paper we consider the problem of comparing an arbitrary Petri net against one whose places may contain only a bounded number of tokens (that is, against a regular behaviour), with respect to trace set inclusion and equivalence, as well as simulation and bisimulation. In contrast to the known result that language equivalence is undecidable, we find that all of the above are in fact decidable. We furthermore demonstrate that it is undecidable whether a given Petri net is either trace equivalent or simulation equivalent to any (unspecified) bounded net. More... »

PAGES

348-362

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-60218-6_26

DOI

http://dx.doi.org/10.1007/3-540-60218-6_26

DIMENSIONS

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


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/11", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Medical and Health Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1117", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Public Health and Health Services", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Ostrava, Dvo\u0159\u00e1kova 7, 701 00, Ostrava 1, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.412684.d", 
          "name": [
            "Department of Computer Science, University of Ostrava, Dvo\u0159\u00e1kova 7, 701 00, Ostrava 1, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jan\u010dar", 
        "givenName": "Petr", 
        "id": "sg:person.07724710171.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07724710171.43"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Swedish Institute of Computer Science, Box 1263, 164 28, Kista, Sweden", 
          "id": "http://www.grid.ac/institutes/grid.450998.9", 
          "name": [
            "Swedish Institute of Computer Science, Box 1263, 164 28, Kista, Sweden"
          ], 
          "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": "1995", 
    "datePublishedReg": "1995-01-01", 
    "description": "In this paper we consider the problem of comparing an arbitrary Petri net against one whose places may contain only a bounded number of tokens (that is, against a regular behaviour), with respect to trace set inclusion and equivalence, as well as simulation and bisimulation. In contrast to the known result that language equivalence is undecidable, we find that all of the above are in fact decidable. We furthermore demonstrate that it is undecidable whether a given Petri net is either trace equivalent or simulation equivalent to any (unspecified) bounded net.", 
    "editor": [
      {
        "familyName": "Lee", 
        "givenName": "Insup", 
        "type": "Person"
      }, 
      {
        "familyName": "Smolka", 
        "givenName": "Scott A.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-60218-6_26", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-60218-7", 
        "978-3-540-44738-2"
      ], 
      "name": "CONCUR '95: Concurrency Theory", 
      "type": "Book"
    }, 
    "keywords": [
      "number of tokens", 
      "language equivalence", 
      "problem", 
      "arbitrary Petri net", 
      "nets", 
      "tokens", 
      "equivalence", 
      "contrast", 
      "results", 
      "fact", 
      "paper", 
      "Petri nets", 
      "place", 
      "number", 
      "respect", 
      "set inclusion", 
      "inclusion", 
      "simulations", 
      "equivalent", 
      "regular properties", 
      "properties", 
      "bisimulation"
    ], 
    "name": "Checking regular properties of Petri nets", 
    "pagination": "348-362", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1050040666"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-60218-6_26"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-60218-6_26", 
      "https://app.dimensions.ai/details/publication/pub.1050040666"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:47", 
    "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_404.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-60218-6_26"
  }
]
 

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-60218-6_26'

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-60218-6_26'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-60218-6_26'

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-60218-6_26'


 

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

97 TRIPLES      23 PREDICATES      48 URIs      41 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-60218-6_26 schema:about anzsrc-for:11
2 anzsrc-for:1117
3 schema:author N924753ad47624fc295e8db9b1af6f4a0
4 schema:datePublished 1995
5 schema:datePublishedReg 1995-01-01
6 schema:description In this paper we consider the problem of comparing an arbitrary Petri net against one whose places may contain only a bounded number of tokens (that is, against a regular behaviour), with respect to trace set inclusion and equivalence, as well as simulation and bisimulation. In contrast to the known result that language equivalence is undecidable, we find that all of the above are in fact decidable. We furthermore demonstrate that it is undecidable whether a given Petri net is either trace equivalent or simulation equivalent to any (unspecified) bounded net.
7 schema:editor N2f80df32c88f4f97b94da392cc5ab11e
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N6a77ff16642447b8b7bfc4e91baecd95
12 schema:keywords Petri nets
13 arbitrary Petri net
14 bisimulation
15 contrast
16 equivalence
17 equivalent
18 fact
19 inclusion
20 language equivalence
21 nets
22 number
23 number of tokens
24 paper
25 place
26 problem
27 properties
28 regular properties
29 respect
30 results
31 set inclusion
32 simulations
33 tokens
34 schema:name Checking regular properties of Petri nets
35 schema:pagination 348-362
36 schema:productId N651332599e6d443b8aed83414c6b8434
37 Na34438d9b33940dbb53ca31bb0ffe215
38 schema:publisher N8757bb920c8a406f9973753689d19eba
39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050040666
40 https://doi.org/10.1007/3-540-60218-6_26
41 schema:sdDatePublished 2022-05-20T07:47
42 schema:sdLicense https://scigraph.springernature.com/explorer/license/
43 schema:sdPublisher Na097860df61c4c398ef073c86e22bad9
44 schema:url https://doi.org/10.1007/3-540-60218-6_26
45 sgo:license sg:explorer/license/
46 sgo:sdDataset chapters
47 rdf:type schema:Chapter
48 N0dd9548269d74a1d9dfbc61704e59621 rdf:first N31f6bdbde7b8491b8bf2a878d9382933
49 rdf:rest rdf:nil
50 N2f80df32c88f4f97b94da392cc5ab11e rdf:first N8db1668359d84950ab6738120fd5eef3
51 rdf:rest N0dd9548269d74a1d9dfbc61704e59621
52 N31f6bdbde7b8491b8bf2a878d9382933 schema:familyName Smolka
53 schema:givenName Scott A.
54 rdf:type schema:Person
55 N651332599e6d443b8aed83414c6b8434 schema:name dimensions_id
56 schema:value pub.1050040666
57 rdf:type schema:PropertyValue
58 N6a77ff16642447b8b7bfc4e91baecd95 schema:isbn 978-3-540-44738-2
59 978-3-540-60218-7
60 schema:name CONCUR '95: Concurrency Theory
61 rdf:type schema:Book
62 N8757bb920c8a406f9973753689d19eba schema:name Springer Nature
63 rdf:type schema:Organisation
64 N8db1668359d84950ab6738120fd5eef3 schema:familyName Lee
65 schema:givenName Insup
66 rdf:type schema:Person
67 N924753ad47624fc295e8db9b1af6f4a0 rdf:first sg:person.07724710171.43
68 rdf:rest Nb0ce8217212543e4a4eaa97cba7d178a
69 Na097860df61c4c398ef073c86e22bad9 schema:name Springer Nature - SN SciGraph project
70 rdf:type schema:Organization
71 Na34438d9b33940dbb53ca31bb0ffe215 schema:name doi
72 schema:value 10.1007/3-540-60218-6_26
73 rdf:type schema:PropertyValue
74 Nb0ce8217212543e4a4eaa97cba7d178a rdf:first sg:person.010425236217.29
75 rdf:rest rdf:nil
76 anzsrc-for:11 schema:inDefinedTermSet anzsrc-for:
77 schema:name Medical and Health Sciences
78 rdf:type schema:DefinedTerm
79 anzsrc-for:1117 schema:inDefinedTermSet anzsrc-for:
80 schema:name Public Health and Health Services
81 rdf:type schema:DefinedTerm
82 sg:person.010425236217.29 schema:affiliation grid-institutes:grid.450998.9
83 schema:familyName Moller
84 schema:givenName Faron
85 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010425236217.29
86 rdf:type schema:Person
87 sg:person.07724710171.43 schema:affiliation grid-institutes:grid.412684.d
88 schema:familyName Jančar
89 schema:givenName Petr
90 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07724710171.43
91 rdf:type schema:Person
92 grid-institutes:grid.412684.d schema:alternateName Department of Computer Science, University of Ostrava, Dvořákova 7, 701 00, Ostrava 1, Czech Republic
93 schema:name Department of Computer Science, University of Ostrava, Dvořákova 7, 701 00, Ostrava 1, Czech Republic
94 rdf:type schema:Organization
95 grid-institutes:grid.450998.9 schema:alternateName Swedish Institute of Computer Science, Box 1263, 164 28, Kista, Sweden
96 schema:name Swedish Institute of Computer Science, Box 1263, 164 28, Kista, Sweden
97 rdf:type schema:Organization
 




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


...