On representing CCS programs by finite petri nets View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1988

AUTHORS

Ursula Goltz

ABSTRACT

A non-interleaving semantics for a subset of CCS using finite place/transition-systems is presented. Straightforward constructions on nets for CCS operations are given. When restricting the language appropriately (no restriction and relabelling, only guarded choice), these operations yield a net semantics with a clear distinction of concurrency and nondeterminism. It is shown that the usual interleaving semantics is retrievable from the net semantics. Partial order semantics and equivalence notions for labelled P/T-systems are discussed. This shows how the intuitive causal dependencies in a CCS program are represented via the net semantics. More... »

PAGES

339-350

Book

TITLE

Mathematical Foundations of Computer Science 1988

ISBN

3-540-50110-X

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bfb0017157

DOI

http://dx.doi.org/10.1007/bfb0017157

DIMENSIONS

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


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/2004", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Linguistics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/20", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Language, Communication and Culture", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "name": [
            "GMD-F1P, Postfach 1240, D-5205\u00a0St. Augustin 1"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Goltz", 
        "givenName": "Ursula", 
        "type": "Person"
      }
    ], 
    "datePublished": "1988", 
    "datePublishedReg": "1988-01-01", 
    "description": "A non-interleaving semantics for a subset of CCS using finite place/transition-systems is presented. Straightforward constructions on nets for CCS operations are given. When restricting the language appropriately (no restriction and relabelling, only guarded choice), these operations yield a net semantics with a clear distinction of concurrency and nondeterminism. It is shown that the usual interleaving semantics is retrievable from the net semantics. Partial order semantics and equivalence notions for labelled P/T-systems are discussed. This shows how the intuitive causal dependencies in a CCS program are represented via the net semantics.", 
    "editor": [
      {
        "familyName": "Chytil", 
        "givenName": "Michal P.", 
        "type": "Person"
      }, 
      {
        "familyName": "Koubek", 
        "givenName": "V\u00e1clav", 
        "type": "Person"
      }, 
      {
        "familyName": "Janiga", 
        "givenName": "Ladislav", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/bfb0017157", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "3-540-50110-X"
      ], 
      "name": "Mathematical Foundations of Computer Science 1988", 
      "type": "Book"
    }, 
    "name": "On representing CCS programs by finite petri nets", 
    "pagination": "339-350", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bfb0017157"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "b8aef23366fc1ed6a5f61fd69154738e65f5196b0e0e8aed4dcdd959e7abc1fa"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1038769915"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin/Heidelberg", 
      "name": "Springer-Verlag", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/bfb0017157", 
      "https://app.dimensions.ai/details/publication/pub.1038769915"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T13:16", 
    "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_8664_00000066.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/BFb0017157"
  }
]
 

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/bfb0017157'

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/bfb0017157'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bfb0017157'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bfb0017157'


 

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/bfb0017157 schema:about anzsrc-for:20
2 anzsrc-for:2004
3 schema:author Nb7b8bcb4e35c4795b581f873b35d2d54
4 schema:datePublished 1988
5 schema:datePublishedReg 1988-01-01
6 schema:description A non-interleaving semantics for a subset of CCS using finite place/transition-systems is presented. Straightforward constructions on nets for CCS operations are given. When restricting the language appropriately (no restriction and relabelling, only guarded choice), these operations yield a net semantics with a clear distinction of concurrency and nondeterminism. It is shown that the usual interleaving semantics is retrievable from the net semantics. Partial order semantics and equivalence notions for labelled P/T-systems are discussed. This shows how the intuitive causal dependencies in a CCS program are represented via the net semantics.
7 schema:editor N19a1a40e687045a1835bbab63d959626
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Ncf801fd6d989425bab40d68b0ed0db55
12 schema:name On representing CCS programs by finite petri nets
13 schema:pagination 339-350
14 schema:productId N62067f7d58d2439b8b27dc685345b76a
15 N9e892a85b4a943cf93e5aad3fe5e3559
16 Nd3f6afd1253b478f8bb1564610b0c910
17 schema:publisher N9533c0a8c0734ad9a2e9ba3fc4e1ff29
18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038769915
19 https://doi.org/10.1007/bfb0017157
20 schema:sdDatePublished 2019-04-15T13:16
21 schema:sdLicense https://scigraph.springernature.com/explorer/license/
22 schema:sdPublisher N939480447e724eb4bdaf15b5633e61d2
23 schema:url http://link.springer.com/10.1007/BFb0017157
24 sgo:license sg:explorer/license/
25 sgo:sdDataset chapters
26 rdf:type schema:Chapter
27 N147eb5952db5424e995c1e8603a1b96d schema:familyName Janiga
28 schema:givenName Ladislav
29 rdf:type schema:Person
30 N176e0929db90498086216e2e90247462 rdf:first Naeddff3481204553b44f47ce041d6ab6
31 rdf:rest N6255194ea33147f782627971b1b0cafa
32 N19a1a40e687045a1835bbab63d959626 rdf:first N96ff8fa84e534459bd8e8e5cbabbd2d4
33 rdf:rest N176e0929db90498086216e2e90247462
34 N46d72c9b533a45ca9f4813974a3b8e36 schema:name GMD-F1P, Postfach 1240, D-5205 St. Augustin 1
35 rdf:type schema:Organization
36 N62067f7d58d2439b8b27dc685345b76a schema:name doi
37 schema:value 10.1007/bfb0017157
38 rdf:type schema:PropertyValue
39 N6255194ea33147f782627971b1b0cafa rdf:first N147eb5952db5424e995c1e8603a1b96d
40 rdf:rest rdf:nil
41 N76de4d6464274b609f004a9ea5a0924e schema:affiliation N46d72c9b533a45ca9f4813974a3b8e36
42 schema:familyName Goltz
43 schema:givenName Ursula
44 rdf:type schema:Person
45 N939480447e724eb4bdaf15b5633e61d2 schema:name Springer Nature - SN SciGraph project
46 rdf:type schema:Organization
47 N9533c0a8c0734ad9a2e9ba3fc4e1ff29 schema:location Berlin/Heidelberg
48 schema:name Springer-Verlag
49 rdf:type schema:Organisation
50 N96ff8fa84e534459bd8e8e5cbabbd2d4 schema:familyName Chytil
51 schema:givenName Michal P.
52 rdf:type schema:Person
53 N9e892a85b4a943cf93e5aad3fe5e3559 schema:name dimensions_id
54 schema:value pub.1038769915
55 rdf:type schema:PropertyValue
56 Naeddff3481204553b44f47ce041d6ab6 schema:familyName Koubek
57 schema:givenName Václav
58 rdf:type schema:Person
59 Nb7b8bcb4e35c4795b581f873b35d2d54 rdf:first N76de4d6464274b609f004a9ea5a0924e
60 rdf:rest rdf:nil
61 Ncf801fd6d989425bab40d68b0ed0db55 schema:isbn 3-540-50110-X
62 schema:name Mathematical Foundations of Computer Science 1988
63 rdf:type schema:Book
64 Nd3f6afd1253b478f8bb1564610b0c910 schema:name readcube_id
65 schema:value b8aef23366fc1ed6a5f61fd69154738e65f5196b0e0e8aed4dcdd959e7abc1fa
66 rdf:type schema:PropertyValue
67 anzsrc-for:20 schema:inDefinedTermSet anzsrc-for:
68 schema:name Language, Communication and Culture
69 rdf:type schema:DefinedTerm
70 anzsrc-for:2004 schema:inDefinedTermSet anzsrc-for:
71 schema:name Linguistics
72 rdf:type schema:DefinedTerm
 




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


...