Assumption commitment rules for networks of asynchronously communicating agents:
Abstract: "This report presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of [Kah74], [Kel78], [BDD+92]: We define two different types of (explicit) assumption/commi...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
München
Techn. Univ., Inst. für Informatik
1993
|
| Schriftenreihe: | Technische Universität <München>: TUM-I
9302 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Zusammenfassung: | Abstract: "This report presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of [Kah74], [Kel78], [BDD+92]: We define two different types of (explicit) assumption/commitment specifications, namely simple and general specifications. It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification. We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoare- logic inspired In particular the feedback rules employ an invariant in the style of a traditional while-rule. Both sets of rules have been proved to be sound and also semantically complete with respect to a chosen set of composition operators. Conversion rules allow the two logics to be combined. This means that general specifications and the rules for general specifications have to be introduced only at the point in a system development where they are really needed. The proposed specification formalism and refinement rules together with a number of related design principles presented in [Bro92d], [Bro92a] constitute a powerful design method which allows distributed systems to be developed in the same style as methods like [Jon90], [Mor90] allow for the design of sequential systems. |
| Beschreibung: | 47 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008037925 | ||
| 003 | DE-604 | ||
| 005 | 20181116 | ||
| 007 | t | ||
| 008 | 930716s1993 d||| |||| 00||| engod | ||
| 016 | 7 | |a 943359414 |2 DE-101 | |
| 035 | |a (OCoLC)643721471 | ||
| 035 | |a (DE-599)BVBBV008037925 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91G |a DE-29T | ||
| 088 | |a TUM I 9303 | ||
| 100 | 1 | |a Stølen, Ketil |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Assumption commitment rules for networks of asynchronously communicating agents |c Ketil Stølen ; Frank Dederichs ; Rainer Weber |
| 264 | 1 | |a München |b Techn. Univ., Inst. für Informatik |c 1993 | |
| 300 | |a 47 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht / A] |v 1993,2 | |
| 490 | 1 | |a Technische Universität <München>: TUM-I |v 9302 | |
| 520 | 3 | |a Abstract: "This report presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of [Kah74], [Kel78], [BDD+92]: We define two different types of (explicit) assumption/commitment specifications, namely simple and general specifications. It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification. We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoare- logic inspired | |
| 520 | 3 | |a In particular the feedback rules employ an invariant in the style of a traditional while-rule. Both sets of rules have been proved to be sound and also semantically complete with respect to a chosen set of composition operators. Conversion rules allow the two logics to be combined. This means that general specifications and the rules for general specifications have to be introduced only at the point in a system development where they are really needed. The proposed specification formalism and refinement rules together with a number of related design principles presented in [Bro92d], [Bro92a] constitute a powerful design method which allows distributed systems to be developed in the same style as methods like [Jon90], [Mor90] allow for the design of sequential systems. | |
| 650 | 4 | |a Formal languages | |
| 700 | 1 | |a Dederichs, Frank |e Verfasser |4 aut | |
| 700 | 1 | |a Weber, Rainer |e Verfasser |4 aut | |
| 810 | 2 | |a A] |t Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht |v 1993,2 |w (DE-604)BV004627888 |9 1993,2 | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9302 |w (DE-604)BV006185376 |9 9302 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005288161&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005288161 | |
Datensatz im Suchindex
| _version_ | 1812461291081564160 |
|---|---|
| adam_text |
CONTENTS
1 INTRODUCTION
2 BASIC CONCEPTS AND NOTATION
2.1 STREAMS.
2.2 PREDICATES.
2.3 STREAM PROCESSING FUNCTIONS.
2.4 AGENTS.
2.4.1 SEQUENTIAL COMPOSITION . . .
2.4.2 PARALLEL COMPOSITION.
2.4.3 FEEDBACK.
2.5 BASIC AGENTS .
3 DECOMPOSING SIMPLE SPECIFICATIONS
3.1 SIMPLE SPECIFICATIONS.
3.2 REFINEMENT.
3.3 REFINEMENT RULES.
3.3.1 CONSEQUENCE RULES.
3.3.2 DECOMPOSITION RULES.
3.4 COMPLETENESS.
3.4.1 SEMANTIC COMPLETENESS.
3.4.2 ADAPTATION COMPLETENESS . .
4 DECOMPOSING GENERAL SPECIFICATIONS
4.1 SYMMETRIC SPECIFICATIONS.
4.2 GENERAL SPECIFICATIONS .
4.3 REFINEMENT RULES.
4.3.1 RELATIONSHIP TO PREVIOUS LOPE
4.3.2 CONSEQUENCE RULES.
4.3.3 DECOMPOSITION RULES.
4.4 COMPLETENESS.
3
5
5
6
6
7
8
8
9
11
12
12
14
15
16
16
21
21
22
24
24
26
30
30
31
31
32
1
BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/943359414
4.4.1 SEMANTIC COMPLETENESS.32
4.4.2 ADAPTATION COMPLETENESS.33
5 CONCLUSIONS 34
5.1 ACKNOWLEDGEMENT.35
A PROOFS 39
A.L LOGIC FOR SIMPLE SPECIFICATIONS.39
A.1.1 SOUNDNESS.39
A.1.2 SEMANTIC COMPLETENESS.42
A.1.3 ADDITIONAL PROOFS.45
A.2 LOGIC FOR GENERAL SPECIFICATIONS.45
A.2.1 SOUNDNESS.45
A.2.2 SEMANTIC COMPLETENESS.47
2 |
| any_adam_object | 1 |
| author | Stølen, Ketil Dederichs, Frank Weber, Rainer |
| author_facet | Stølen, Ketil Dederichs, Frank Weber, Rainer |
| author_role | aut aut aut |
| author_sort | Stølen, Ketil |
| author_variant | k s ks f d fd r w rw |
| building | Verbundindex |
| bvnumber | BV008037925 |
| ctrlnum | (OCoLC)643721471 (DE-599)BVBBV008037925 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV008037925</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20181116</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930716s1993 d||| |||| 00||| engod</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">943359414</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)643721471</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008037925</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM I 9303</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">Assumption commitment rules for networks of asynchronously communicating agents</subfield><subfield code="c">Ketil Stølen ; Frank Dederichs ; Rainer Weber</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">Techn. Univ., Inst. für Informatik</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">47 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">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht / A]</subfield><subfield code="v">1993,2</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9302</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This report presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of [Kah74], [Kel78], [BDD+92]: We define two different types of (explicit) assumption/commitment specifications, namely simple and general specifications. It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification. We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoare- logic inspired</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In particular the feedback rules employ an invariant in the style of a traditional while-rule. Both sets of rules have been proved to be sound and also semantically complete with respect to a chosen set of composition operators. Conversion rules allow the two logics to be combined. This means that general specifications and the rules for general specifications have to be introduced only at the point in a system development where they are really needed. The proposed specification formalism and refinement rules together with a number of related design principles presented in [Bro92d], [Bro92a] constitute a powerful design method which allows distributed systems to be developed in the same style as methods like [Jon90], [Mor90] allow for the design of sequential systems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dederichs, Frank</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Weber, Rainer</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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 <München>: [SFB-Bericht</subfield><subfield code="v">1993,2</subfield><subfield code="w">(DE-604)BV004627888</subfield><subfield code="9">1993,2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9302</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9302</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005288161&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005288161</subfield></datafield></record></collection> |
| id | DE-604.BV008037925 |
| illustrated | Illustrated |
| indexdate | 2024-10-09T18:16:20Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005288161 |
| oclc_num | 643721471 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM DE-29T |
| owner_facet | DE-12 DE-91G DE-BY-TUM DE-29T |
| physical | 47 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Techn. Univ., Inst. für Informatik |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht / A] Technische Universität <München>: TUM-I |
| spelling | Stølen, Ketil Verfasser aut Assumption commitment rules for networks of asynchronously communicating agents Ketil Stølen ; Frank Dederichs ; Rainer Weber München Techn. Univ., Inst. für Informatik 1993 47 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht / A] 1993,2 Technische Universität <München>: TUM-I 9302 Abstract: "This report presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of [Kah74], [Kel78], [BDD+92]: We define two different types of (explicit) assumption/commitment specifications, namely simple and general specifications. It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification. We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoare- logic inspired In particular the feedback rules employ an invariant in the style of a traditional while-rule. Both sets of rules have been proved to be sound and also semantically complete with respect to a chosen set of composition operators. Conversion rules allow the two logics to be combined. This means that general specifications and the rules for general specifications have to be introduced only at the point in a system development where they are really needed. The proposed specification formalism and refinement rules together with a number of related design principles presented in [Bro92d], [Bro92a] constitute a powerful design method which allows distributed systems to be developed in the same style as methods like [Jon90], [Mor90] allow for the design of sequential systems. Formal languages Dederichs, Frank Verfasser aut Weber, Rainer Verfasser aut A] Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht 1993,2 (DE-604)BV004627888 1993,2 Technische Universität <München>: TUM-I 9302 (DE-604)BV006185376 9302 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005288161&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Stølen, Ketil Dederichs, Frank Weber, Rainer Assumption commitment rules for networks of asynchronously communicating agents Technische Universität <München>: TUM-I Formal languages |
| title | Assumption commitment rules for networks of asynchronously communicating agents |
| title_auth | Assumption commitment rules for networks of asynchronously communicating agents |
| title_exact_search | Assumption commitment rules for networks of asynchronously communicating agents |
| title_full | Assumption commitment rules for networks of asynchronously communicating agents Ketil Stølen ; Frank Dederichs ; Rainer Weber |
| title_fullStr | Assumption commitment rules for networks of asynchronously communicating agents Ketil Stølen ; Frank Dederichs ; Rainer Weber |
| title_full_unstemmed | Assumption commitment rules for networks of asynchronously communicating agents Ketil Stølen ; Frank Dederichs ; Rainer Weber |
| title_short | Assumption commitment rules for networks of asynchronously communicating agents |
| title_sort | assumption commitment rules for networks of asynchronously communicating agents |
| topic | Formal languages |
| topic_facet | Formal languages |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005288161&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV004627888 (DE-604)BV006185376 |
| work_keys_str_mv | AT stølenketil assumptioncommitmentrulesfornetworksofasynchronouslycommunicatingagents AT dederichsfrank assumptioncommitmentrulesfornetworksofasynchronouslycommunicatingagents AT weberrainer assumptioncommitmentrulesfornetworksofasynchronouslycommunicatingagents |