Relating processes with respect to speed View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1991

AUTHORS

Faron Moller , Chris Tofts

ABSTRACT

In this paper, we consider the problem of defining a preorder on concurrent processes which will distinguish between functionally behaviourally equivalent processes which operate at different speeds. As our basic framework, we use a subset of the calculus TCCS of [Mol90], a language for describing concurrent processes involving timing constraints.There is an anomaly in timed process calculi such as TCCS which nullifies the possibility of defining such a preorder which is a precongruence. This anomaly arises due to the nature of the constructs in the calculus which force events to be executed without delay. To rectify this conflict, we define and motivate the above mentioned subcalculus, which we call ℓTCCS (loose TCCS), and define our relation over this language. ℓTCCS is precisely TCCS where all events may delay indefinitely before executing. We demonstrate why this is necessary in order for any sensible faster than relation to be a precongruence.Upon providing the semantic definition of our “faster than” relation, we give results on the precongruicity of the relation and present a set of inequational laws. More... »

PAGES

424-438

Book

TITLE

CONCUR '91

ISBN

978-3-540-54430-2
978-3-540-38357-4

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-54430-5_104

DOI

http://dx.doi.org/10.1007/3-540-54430-5_104

DIMENSIONS

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


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": "Department of Computer Science, University of Edinburgh, UK", 
          "id": "http://www.grid.ac/institutes/grid.4305.2", 
          "name": [
            "Department of Computer Science, University of Edinburgh, UK"
          ], 
          "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"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Edinburgh, UK", 
          "id": "http://www.grid.ac/institutes/grid.4305.2", 
          "name": [
            "Department of Computer Science, University of Edinburgh, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tofts", 
        "givenName": "Chris", 
        "id": "sg:person.012666473500.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012666473500.00"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1991", 
    "datePublishedReg": "1991-01-01", 
    "description": "In this paper, we consider the problem of defining a preorder on concurrent processes which will distinguish between functionally behaviourally equivalent processes which operate at different speeds. As our basic framework, we use a subset of the calculus TCCS of [Mol90], a language for describing concurrent processes involving timing constraints.There is an anomaly in timed process calculi such as TCCS which nullifies the possibility of defining such a preorder which is a precongruence. This anomaly arises due to the nature of the constructs in the calculus which force events to be executed without delay. To rectify this conflict, we define and motivate the above mentioned subcalculus, which we call \u2113TCCS (loose TCCS), and define our relation over this language. \u2113TCCS is precisely TCCS where all events may delay indefinitely before executing. We demonstrate why this is necessary in order for any sensible faster than relation to be a precongruence.Upon providing the semantic definition of our \u201cfaster than\u201d relation, we give results on the precongruicity of the relation and present a set of inequational laws.", 
    "editor": [
      {
        "familyName": "Baeten", 
        "givenName": "Jos C. M.", 
        "type": "Person"
      }, 
      {
        "familyName": "Groote", 
        "givenName": "Jan Frisco", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-54430-5_104", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-54430-2", 
        "978-3-540-38357-4"
      ], 
      "name": "CONCUR '91", 
      "type": "Book"
    }, 
    "keywords": [
      "language", 
      "constructs", 
      "relation", 
      "conflict", 
      "equivalent process", 
      "concurrent processes", 
      "process", 
      "events", 
      "speed", 
      "basic framework", 
      "different speeds", 
      "framework", 
      "nature", 
      "delay", 
      "problem", 
      "semantic definition", 
      "definition", 
      "results", 
      "set", 
      "possibility", 
      "respect", 
      "order", 
      "paper", 
      "subset", 
      "constraints", 
      "timing constraints", 
      "law", 
      "anomalies", 
      "calculus", 
      "preorder", 
      "process calculus", 
      "TCCS", 
      "timed process calculi", 
      "precongruence", 
      "subcalculus"
    ], 
    "name": "Relating processes with respect to speed", 
    "pagination": "424-438", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1009736593"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-54430-5_104"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-54430-5_104", 
      "https://app.dimensions.ai/details/publication/pub.1009736593"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:48", 
    "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_432.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-54430-5_104"
  }
]
 

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-54430-5_104'

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-54430-5_104'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-54430-5_104'

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-54430-5_104'


 

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

107 TRIPLES      23 PREDICATES      61 URIs      54 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-54430-5_104 schema:about anzsrc-for:17
2 anzsrc-for:1701
3 schema:author N5c22e150e3024c1291eb4071d4183b65
4 schema:datePublished 1991
5 schema:datePublishedReg 1991-01-01
6 schema:description In this paper, we consider the problem of defining a preorder on concurrent processes which will distinguish between functionally behaviourally equivalent processes which operate at different speeds. As our basic framework, we use a subset of the calculus TCCS of [Mol90], a language for describing concurrent processes involving timing constraints.There is an anomaly in timed process calculi such as TCCS which nullifies the possibility of defining such a preorder which is a precongruence. This anomaly arises due to the nature of the constructs in the calculus which force events to be executed without delay. To rectify this conflict, we define and motivate the above mentioned subcalculus, which we call ℓTCCS (loose TCCS), and define our relation over this language. ℓTCCS is precisely TCCS where all events may delay indefinitely before executing. We demonstrate why this is necessary in order for any sensible faster than relation to be a precongruence.Upon providing the semantic definition of our “faster than” relation, we give results on the precongruicity of the relation and present a set of inequational laws.
7 schema:editor N44a8d2c4acc2427ca25f6e021c34c86e
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Na485bcc5302a42c694ff507f2c949a16
12 schema:keywords TCCS
13 anomalies
14 basic framework
15 calculus
16 concurrent processes
17 conflict
18 constraints
19 constructs
20 definition
21 delay
22 different speeds
23 equivalent process
24 events
25 framework
26 language
27 law
28 nature
29 order
30 paper
31 possibility
32 precongruence
33 preorder
34 problem
35 process
36 process calculus
37 relation
38 respect
39 results
40 semantic definition
41 set
42 speed
43 subcalculus
44 subset
45 timed process calculi
46 timing constraints
47 schema:name Relating processes with respect to speed
48 schema:pagination 424-438
49 schema:productId N065da87e3d7f4ec8bfec9d60cd83d318
50 Nf132daa562e541b6b4af6afc164b6ddf
51 schema:publisher N13d3ab0811d74fb6ba37280bc13ce55e
52 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009736593
53 https://doi.org/10.1007/3-540-54430-5_104
54 schema:sdDatePublished 2022-05-20T07:48
55 schema:sdLicense https://scigraph.springernature.com/explorer/license/
56 schema:sdPublisher Neaa361ff5ab248ef8bfecf3d55553330
57 schema:url https://doi.org/10.1007/3-540-54430-5_104
58 sgo:license sg:explorer/license/
59 sgo:sdDataset chapters
60 rdf:type schema:Chapter
61 N065da87e3d7f4ec8bfec9d60cd83d318 schema:name dimensions_id
62 schema:value pub.1009736593
63 rdf:type schema:PropertyValue
64 N13d3ab0811d74fb6ba37280bc13ce55e schema:name Springer Nature
65 rdf:type schema:Organisation
66 N3699e6423dc54e0ba74f7fac1c30b7ff rdf:first sg:person.012666473500.00
67 rdf:rest rdf:nil
68 N3b48dede93624e949ddceeffc0164e0f schema:familyName Baeten
69 schema:givenName Jos C. M.
70 rdf:type schema:Person
71 N44a8d2c4acc2427ca25f6e021c34c86e rdf:first N3b48dede93624e949ddceeffc0164e0f
72 rdf:rest N98e1d2bfe31447e09f055efe8438ed60
73 N5c22e150e3024c1291eb4071d4183b65 rdf:first sg:person.010425236217.29
74 rdf:rest N3699e6423dc54e0ba74f7fac1c30b7ff
75 N98e1d2bfe31447e09f055efe8438ed60 rdf:first Ndddf0b8a4f0042fabb1f73ca8d02c1ba
76 rdf:rest rdf:nil
77 Na485bcc5302a42c694ff507f2c949a16 schema:isbn 978-3-540-38357-4
78 978-3-540-54430-2
79 schema:name CONCUR '91
80 rdf:type schema:Book
81 Ndddf0b8a4f0042fabb1f73ca8d02c1ba schema:familyName Groote
82 schema:givenName Jan Frisco
83 rdf:type schema:Person
84 Neaa361ff5ab248ef8bfecf3d55553330 schema:name Springer Nature - SN SciGraph project
85 rdf:type schema:Organization
86 Nf132daa562e541b6b4af6afc164b6ddf schema:name doi
87 schema:value 10.1007/3-540-54430-5_104
88 rdf:type schema:PropertyValue
89 anzsrc-for:17 schema:inDefinedTermSet anzsrc-for:
90 schema:name Psychology and Cognitive Sciences
91 rdf:type schema:DefinedTerm
92 anzsrc-for:1701 schema:inDefinedTermSet anzsrc-for:
93 schema:name Psychology
94 rdf:type schema:DefinedTerm
95 sg:person.010425236217.29 schema:affiliation grid-institutes:grid.4305.2
96 schema:familyName Moller
97 schema:givenName Faron
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010425236217.29
99 rdf:type schema:Person
100 sg:person.012666473500.00 schema:affiliation grid-institutes:grid.4305.2
101 schema:familyName Tofts
102 schema:givenName Chris
103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012666473500.00
104 rdf:type schema:Person
105 grid-institutes:grid.4305.2 schema:alternateName Department of Computer Science, University of Edinburgh, UK
106 schema:name Department of Computer Science, University of Edinburgh, UK
107 rdf:type schema:Organization
 




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


...