A refinement relation supporting the transition from unbounded to bounded communication buffers:
Abstract: "This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification based on purely asynchronous communication can for example be refined into a system specification where the...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
München
1994
|
| Series: | Technische Universität <München>: TUM-I
9435 |
| Subjects: | |
| Summary: | Abstract: "This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification based on purely asynchronous communication can for example be refined into a system specification where the components communicate purely in terms of hand- shakes. First a weak version called partial refinement is introduced. Partial refinement guarantees only the preservation of safety properties. This refinement relation is then strengthened into total refinement which preserves both safety and liveness properties. Thus a total refinement is also a partial refinement. The suitability of this refinement relation for top-down design is discussed and some examples are given." |
| Physical Description: | 24 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010382362 | ||
| 003 | DE-604 | ||
| 005 | 20040416 | ||
| 007 | t | ||
| 008 | 950913s1994 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)35123067 | ||
| 035 | |a (DE-599)BVBBV010382362 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-12 |a DE-91G | ||
| 100 | 1 | |a Stølen, Ketil |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A refinement relation supporting the transition from unbounded to bounded communication buffers |c Ketil Stølen |
| 264 | 1 | |a München |c 1994 | |
| 300 | |a 24 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-I |v 9435 | |
| 490 | 1 | |a Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A |v 1994,17 | |
| 520 | 3 | |a Abstract: "This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification based on purely asynchronous communication can for example be refined into a system specification where the components communicate purely in terms of hand- shakes. First a weak version called partial refinement is introduced. Partial refinement guarantees only the preservation of safety properties. This refinement relation is then strengthened into total refinement which preserves both safety and liveness properties. Thus a total refinement is also a partial refinement. The suitability of this refinement relation for top-down design is discussed and some examples are given." | |
| 650 | 4 | |a Buffer storage (Computer science) | |
| 650 | 4 | |a Packet switching (Data transmission) | |
| 650 | 4 | |a Signal processing |x Digital techniques | |
| 810 | 2 | |a A |t Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht |v 1994,17 |w (DE-604)BV004627888 |9 1994,17 | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9435 |w (DE-604)BV006185376 |9 9435 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006912181 | ||
Record in the Search Index
| _version_ | 1804124806835077120 |
|---|---|
| any_adam_object | |
| author | Stølen, Ketil |
| author_facet | Stølen, Ketil |
| author_role | aut |
| author_sort | Stølen, Ketil |
| author_variant | k s ks |
| building | Verbundindex |
| bvnumber | BV010382362 |
| ctrlnum | (OCoLC)35123067 (DE-599)BVBBV010382362 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02121nam a2200337 cb4500</leader><controlfield tag="001">BV010382362</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040416 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950913s1994 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35123067</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010382362</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stølen, Ketil</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A refinement relation supporting the transition from unbounded to bounded communication buffers</subfield><subfield code="c">Ketil Stølen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9435</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A</subfield><subfield code="v">1994,17</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification based on purely asynchronous communication can for example be refined into a system specification where the components communicate purely in terms of hand- shakes. First a weak version called partial refinement is introduced. Partial refinement guarantees only the preservation of safety properties. This refinement relation is then strengthened into total refinement which preserves both safety and liveness properties. Thus a total refinement is also a partial refinement. The suitability of this refinement relation for top-down design is discussed and some examples are given."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Buffer storage (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Packet switching (Data transmission)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Signal processing</subfield><subfield code="x">Digital techniques</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">A</subfield><subfield code="t">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht</subfield><subfield code="v">1994,17</subfield><subfield code="w">(DE-604)BV004627888</subfield><subfield code="9">1994,17</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9435</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9435</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006912181</subfield></datafield></record></collection> |
| id | DE-604.BV010382362 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:51:31Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006912181 |
| oclc_num | 35123067 |
| open_access_boolean | |
| owner | DE-29T DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-12 DE-91G DE-BY-TUM |
| physical | 24 S. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A |
| spelling | Stølen, Ketil Verfasser aut A refinement relation supporting the transition from unbounded to bounded communication buffers Ketil Stølen München 1994 24 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9435 Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A 1994,17 Abstract: "This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification based on purely asynchronous communication can for example be refined into a system specification where the components communicate purely in terms of hand- shakes. First a weak version called partial refinement is introduced. Partial refinement guarantees only the preservation of safety properties. This refinement relation is then strengthened into total refinement which preserves both safety and liveness properties. Thus a total refinement is also a partial refinement. The suitability of this refinement relation for top-down design is discussed and some examples are given." Buffer storage (Computer science) Packet switching (Data transmission) Signal processing Digital techniques A Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht 1994,17 (DE-604)BV004627888 1994,17 Technische Universität <München>: TUM-I 9435 (DE-604)BV006185376 9435 |
| spellingShingle | Stølen, Ketil A refinement relation supporting the transition from unbounded to bounded communication buffers Technische Universität <München>: TUM-I Buffer storage (Computer science) Packet switching (Data transmission) Signal processing Digital techniques |
| title | A refinement relation supporting the transition from unbounded to bounded communication buffers |
| title_auth | A refinement relation supporting the transition from unbounded to bounded communication buffers |
| title_exact_search | A refinement relation supporting the transition from unbounded to bounded communication buffers |
| title_full | A refinement relation supporting the transition from unbounded to bounded communication buffers Ketil Stølen |
| title_fullStr | A refinement relation supporting the transition from unbounded to bounded communication buffers Ketil Stølen |
| title_full_unstemmed | A refinement relation supporting the transition from unbounded to bounded communication buffers Ketil Stølen |
| title_short | A refinement relation supporting the transition from unbounded to bounded communication buffers |
| title_sort | a refinement relation supporting the transition from unbounded to bounded communication buffers |
| topic | Buffer storage (Computer science) Packet switching (Data transmission) Signal processing Digital techniques |
| topic_facet | Buffer storage (Computer science) Packet switching (Data transmission) Signal processing Digital techniques |
| volume_link | (DE-604)BV004627888 (DE-604)BV006185376 |
| work_keys_str_mv | AT stølenketil arefinementrelationsupportingthetransitionfromunboundedtoboundedcommunicationbuffers |