Deciding Bisimilarity between BPA and BPP Processes View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2003

AUTHORS

Petr Jančar , Antonín Kučera , Faron Moller

ABSTRACT

We identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective procedure for testing if this condition holds of a given BPP, and in the positive case we provide an effective construction for a particular form of one-counter automaton which is bisimilar to the given BPP. This in turn provides the mechanism to decide bisimilarity between a given BPP process and a given BPA process. More... »

PAGES

159-173

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-45187-7_10

DOI

http://dx.doi.org/10.1007/978-3-540-45187-7_10

DIMENSIONS

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


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/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": "Dept. of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, 70833, Ostrava, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.440850.d", 
          "name": [
            "Dept. of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, 70833, Ostrava, 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": "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.10267.32", 
          "name": [
            "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Ku\u010dera", 
        "givenName": "Anton\u00edn", 
        "id": "sg:person.012453075541.89", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012453075541.89"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. of Computer Science, University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, Wales", 
          "id": "http://www.grid.ac/institutes/grid.4827.9", 
          "name": [
            "Dept. of Computer Science, University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, Wales"
          ], 
          "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": "2003", 
    "datePublishedReg": "2003-01-01", 
    "description": "We identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective procedure for testing if this condition holds of a given BPP, and in the positive case we provide an effective construction for a particular form of one-counter automaton which is bisimilar to the given BPP. This in turn provides the mechanism to decide bisimilarity between a given BPP process and a given BPA process.", 
    "editor": [
      {
        "familyName": "Amadio", 
        "givenName": "Roberto", 
        "type": "Person"
      }, 
      {
        "familyName": "Lugiez", 
        "givenName": "Denis", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-45187-7_10", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-40753-9", 
        "978-3-540-45187-7"
      ], 
      "name": "CONCUR 2003 - Concurrency Theory", 
      "type": "Book"
    }, 
    "keywords": [
      "process", 
      "effective construction", 
      "conditions", 
      "necessary condition", 
      "construction", 
      "testing", 
      "procedure", 
      "BPP", 
      "BPA", 
      "turn", 
      "mechanism", 
      "cases", 
      "form", 
      "effective procedure", 
      "particular form", 
      "automata", 
      "positive cases", 
      "BPP processes", 
      "BPA processes", 
      "bisimilarity", 
      "one-counter automata"
    ], 
    "name": "Deciding Bisimilarity between BPA and BPP Processes", 
    "pagination": "159-173", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1005120253"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-45187-7_10"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-45187-7_10", 
      "https://app.dimensions.ai/details/publication/pub.1005120253"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:44", 
    "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_274.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-45187-7_10"
  }
]
 

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/978-3-540-45187-7_10'

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/978-3-540-45187-7_10'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-45187-7_10'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-45187-7_10'


 

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

106 TRIPLES      23 PREDICATES      47 URIs      40 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-45187-7_10 schema:about anzsrc-for:17
2 anzsrc-for:1701
3 schema:author N29841ac57b60470085742fe6c169b001
4 schema:datePublished 2003
5 schema:datePublishedReg 2003-01-01
6 schema:description We identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective procedure for testing if this condition holds of a given BPP, and in the positive case we provide an effective construction for a particular form of one-counter automaton which is bisimilar to the given BPP. This in turn provides the mechanism to decide bisimilarity between a given BPP process and a given BPA process.
7 schema:editor N24143660b0f445d08f3eed943c3aab7c
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Ne9c3f9f98148467baf16fb09658caeea
12 schema:keywords BPA
13 BPA processes
14 BPP
15 BPP processes
16 automata
17 bisimilarity
18 cases
19 conditions
20 construction
21 effective construction
22 effective procedure
23 form
24 mechanism
25 necessary condition
26 one-counter automata
27 particular form
28 positive cases
29 procedure
30 process
31 testing
32 turn
33 schema:name Deciding Bisimilarity between BPA and BPP Processes
34 schema:pagination 159-173
35 schema:productId N86c661a9481949be89b63adfd64ef068
36 Nf23cb234a7a844738e172da5702d90be
37 schema:publisher N165e0e99314748d99deb41cc9e237398
38 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005120253
39 https://doi.org/10.1007/978-3-540-45187-7_10
40 schema:sdDatePublished 2022-05-20T07:44
41 schema:sdLicense https://scigraph.springernature.com/explorer/license/
42 schema:sdPublisher N01142b39c0c541f495dc2b75e35415d3
43 schema:url https://doi.org/10.1007/978-3-540-45187-7_10
44 sgo:license sg:explorer/license/
45 sgo:sdDataset chapters
46 rdf:type schema:Chapter
47 N01142b39c0c541f495dc2b75e35415d3 schema:name Springer Nature - SN SciGraph project
48 rdf:type schema:Organization
49 N098b4d333a08466ca4156c7ecd92937d schema:familyName Amadio
50 schema:givenName Roberto
51 rdf:type schema:Person
52 N165e0e99314748d99deb41cc9e237398 schema:name Springer Nature
53 rdf:type schema:Organisation
54 N24143660b0f445d08f3eed943c3aab7c rdf:first N098b4d333a08466ca4156c7ecd92937d
55 rdf:rest Ncc0ece8c99b7463899cdcd93ae35e019
56 N26fc280b9c074850a69706eb6da9d63e rdf:first sg:person.012453075541.89
57 rdf:rest Ndec91e9f3c404d0eada749cdb090e126
58 N29841ac57b60470085742fe6c169b001 rdf:first sg:person.07724710171.43
59 rdf:rest N26fc280b9c074850a69706eb6da9d63e
60 N86c661a9481949be89b63adfd64ef068 schema:name doi
61 schema:value 10.1007/978-3-540-45187-7_10
62 rdf:type schema:PropertyValue
63 Ncc0ece8c99b7463899cdcd93ae35e019 rdf:first Nd37533549b724c94a5343f6e3a00b6c0
64 rdf:rest rdf:nil
65 Nd37533549b724c94a5343f6e3a00b6c0 schema:familyName Lugiez
66 schema:givenName Denis
67 rdf:type schema:Person
68 Ndec91e9f3c404d0eada749cdb090e126 rdf:first sg:person.010425236217.29
69 rdf:rest rdf:nil
70 Ne9c3f9f98148467baf16fb09658caeea schema:isbn 978-3-540-40753-9
71 978-3-540-45187-7
72 schema:name CONCUR 2003 - Concurrency Theory
73 rdf:type schema:Book
74 Nf23cb234a7a844738e172da5702d90be schema:name dimensions_id
75 schema:value pub.1005120253
76 rdf:type schema:PropertyValue
77 anzsrc-for:17 schema:inDefinedTermSet anzsrc-for:
78 schema:name Psychology and Cognitive Sciences
79 rdf:type schema:DefinedTerm
80 anzsrc-for:1701 schema:inDefinedTermSet anzsrc-for:
81 schema:name Psychology
82 rdf:type schema:DefinedTerm
83 sg:person.010425236217.29 schema:affiliation grid-institutes:grid.4827.9
84 schema:familyName Moller
85 schema:givenName Faron
86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010425236217.29
87 rdf:type schema:Person
88 sg:person.012453075541.89 schema:affiliation grid-institutes:grid.10267.32
89 schema:familyName Kučera
90 schema:givenName Antonín
91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012453075541.89
92 rdf:type schema:Person
93 sg:person.07724710171.43 schema:affiliation grid-institutes:grid.440850.d
94 schema:familyName Jančar
95 schema:givenName Petr
96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07724710171.43
97 rdf:type schema:Person
98 grid-institutes:grid.10267.32 schema:alternateName Faculty of Informatics, Masaryk University, Botanická 68a, 60200, Brno, Czech Republic
99 schema:name Faculty of Informatics, Masaryk University, Botanická 68a, 60200, Brno, Czech Republic
100 rdf:type schema:Organization
101 grid-institutes:grid.440850.d schema:alternateName Dept. of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, 70833, Ostrava, Czech Republic
102 schema:name Dept. of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, 70833, Ostrava, Czech Republic
103 rdf:type schema:Organization
104 grid-institutes:grid.4827.9 schema:alternateName Dept. of Computer Science, University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, Wales
105 schema:name Dept. of Computer Science, University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, Wales
106 rdf:type schema:Organization
 




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


...