A verification of the Bakery protocol combining algebraic and model-oriented techniques:
Abstract: "In this paper we give a specification of the so called Bakery protocol in an extension of the process algebra ACP with abstract datatypes. We prove that this protocol is equal to a Queue, modulo branching bisimulation equivalence. The verification is as follows. First we give a linea...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Amsterdam
Centrum voor Wiskunde en Informatica
1996
|
| Schriftenreihe: | Report / Centrum voor Wiskunde en Informatica
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper we give a specification of the so called Bakery protocol in an extension of the process algebra ACP with abstract datatypes. We prove that this protocol is equal to a Queue, modulo branching bisimulation equivalence. The verification is as follows. First we give a linear specification of the Bakery, that is a specification without parallelism. Then we introduce an invariant and encorporate this invariant into the linear specification of the Bakery and the specification of the Quene. Finally, we give a boolean function on the arguments of the resulting specification of the Bakery and the Queue, and we prove that by its equations it defines a branching bisimulation. This paper can be considered as an alternative to the proof of Groote and Korver [GK94], that proves the correctness of the Bakery protocol modulo weak bisimulation (or observational congruence) completely within the proof system of [mu]CRL." |
| Beschreibung: | Literaturverz. S. 14 |
| Beschreibung: | 24 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021938481 | ||
| 003 | DE-604 | ||
| 005 | 20040302000000.0 | ||
| 007 | t | ||
| 008 | 980130s1996 t||| 00||| ger d | ||
| 035 | |a (OCoLC)35709990 | ||
| 035 | |a (DE-599)BVBBV021938481 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-706 |a DE-83 | ||
| 088 | |a CS R 9619 | ||
| 100 | 1 | |a Brovedani, Claudia |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A verification of the Bakery protocol combining algebraic and model-oriented techniques |c C. Brovedani ; A. S. Klusener |
| 264 | 1 | |a Amsterdam |b Centrum voor Wiskunde en Informatica |c 1996 | |
| 300 | |a 24 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Report / Centrum voor Wiskunde en Informatica | |
| 500 | |a Literaturverz. S. 14 | ||
| 520 | 3 | |a Abstract: "In this paper we give a specification of the so called Bakery protocol in an extension of the process algebra ACP with abstract datatypes. We prove that this protocol is equal to a Queue, modulo branching bisimulation equivalence. The verification is as follows. First we give a linear specification of the Bakery, that is a specification without parallelism. Then we introduce an invariant and encorporate this invariant into the linear specification of the Bakery and the specification of the Quene. Finally, we give a boolean function on the arguments of the resulting specification of the Bakery and the Queue, and we prove that by its equations it defines a branching bisimulation. This paper can be considered as an alternative to the proof of Groote and Korver [GK94], that proves the correctness of the Bakery protocol modulo weak bisimulation (or observational congruence) completely within the proof system of [mu]CRL." | |
| 650 | 4 | |a Abstract data types (Computer science) | |
| 650 | 4 | |a Computer network protocols | |
| 650 | 4 | |a Proof theory | |
| 650 | 0 | 7 | |a Prozessalgebra |0 (DE-588)4283920-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4155043-2 |a Forschungsbericht |2 gnd-content | |
| 689 | 0 | 0 | |a Prozessalgebra |0 (DE-588)4283920-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Klusener, A. Steven |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015153631 | ||
Datensatz im Suchindex
| _version_ | 1804135897980993536 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Brovedani, Claudia Klusener, A. Steven |
| author_facet | Brovedani, Claudia Klusener, A. Steven |
| author_role | aut aut |
| author_sort | Brovedani, Claudia |
| author_variant | c b cb a s k as ask |
| building | Verbundindex |
| bvnumber | BV021938481 |
| ctrlnum | (OCoLC)35709990 (DE-599)BVBBV021938481 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02208nam a2200385zc 4500</leader><controlfield tag="001">BV021938481</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040302000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980130s1996 t||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35709990</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021938481</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CS R 9619</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brovedani, Claudia</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A verification of the Bakery protocol combining algebraic and model-oriented techniques</subfield><subfield code="c">C. Brovedani ; A. S. Klusener</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">Centrum voor Wiskunde en Informatica</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 S.</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="0" ind2=" "><subfield code="a">Report / Centrum voor Wiskunde en Informatica</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 14</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we give a specification of the so called Bakery protocol in an extension of the process algebra ACP with abstract datatypes. We prove that this protocol is equal to a Queue, modulo branching bisimulation equivalence. The verification is as follows. First we give a linear specification of the Bakery, that is a specification without parallelism. Then we introduce an invariant and encorporate this invariant into the linear specification of the Bakery and the specification of the Quene. Finally, we give a boolean function on the arguments of the resulting specification of the Bakery and the Queue, and we prove that by its equations it defines a branching bisimulation. This paper can be considered as an alternative to the proof of Groote and Korver [GK94], that proves the correctness of the Bakery protocol modulo weak bisimulation (or observational congruence) completely within the proof system of [mu]CRL."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Abstract data types (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer network protocols</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prozessalgebra</subfield><subfield code="0">(DE-588)4283920-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4155043-2</subfield><subfield code="a">Forschungsbericht</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Prozessalgebra</subfield><subfield code="0">(DE-588)4283920-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Klusener, A. Steven</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015153631</subfield></datafield></record></collection> |
| genre | (DE-588)4155043-2 Forschungsbericht gnd-content |
| genre_facet | Forschungsbericht |
| id | DE-604.BV021938481 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:06:46Z |
| indexdate | 2024-07-09T20:47:49Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015153631 |
| oclc_num | 35709990 |
| open_access_boolean | |
| owner | DE-706 DE-83 |
| owner_facet | DE-706 DE-83 |
| physical | 24 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Centrum voor Wiskunde en Informatica |
| record_format | marc |
| series2 | Report / Centrum voor Wiskunde en Informatica |
| spelling | Brovedani, Claudia Verfasser aut A verification of the Bakery protocol combining algebraic and model-oriented techniques C. Brovedani ; A. S. Klusener Amsterdam Centrum voor Wiskunde en Informatica 1996 24 S. txt rdacontent n rdamedia nc rdacarrier Report / Centrum voor Wiskunde en Informatica Literaturverz. S. 14 Abstract: "In this paper we give a specification of the so called Bakery protocol in an extension of the process algebra ACP with abstract datatypes. We prove that this protocol is equal to a Queue, modulo branching bisimulation equivalence. The verification is as follows. First we give a linear specification of the Bakery, that is a specification without parallelism. Then we introduce an invariant and encorporate this invariant into the linear specification of the Bakery and the specification of the Quene. Finally, we give a boolean function on the arguments of the resulting specification of the Bakery and the Queue, and we prove that by its equations it defines a branching bisimulation. This paper can be considered as an alternative to the proof of Groote and Korver [GK94], that proves the correctness of the Bakery protocol modulo weak bisimulation (or observational congruence) completely within the proof system of [mu]CRL." Abstract data types (Computer science) Computer network protocols Proof theory Prozessalgebra (DE-588)4283920-8 gnd rswk-swf (DE-588)4155043-2 Forschungsbericht gnd-content Prozessalgebra (DE-588)4283920-8 s DE-604 Klusener, A. Steven Verfasser aut |
| spellingShingle | Brovedani, Claudia Klusener, A. Steven A verification of the Bakery protocol combining algebraic and model-oriented techniques Abstract data types (Computer science) Computer network protocols Proof theory Prozessalgebra (DE-588)4283920-8 gnd |
| subject_GND | (DE-588)4283920-8 (DE-588)4155043-2 |
| title | A verification of the Bakery protocol combining algebraic and model-oriented techniques |
| title_auth | A verification of the Bakery protocol combining algebraic and model-oriented techniques |
| title_exact_search | A verification of the Bakery protocol combining algebraic and model-oriented techniques |
| title_exact_search_txtP | A verification of the Bakery protocol combining algebraic and model-oriented techniques |
| title_full | A verification of the Bakery protocol combining algebraic and model-oriented techniques C. Brovedani ; A. S. Klusener |
| title_fullStr | A verification of the Bakery protocol combining algebraic and model-oriented techniques C. Brovedani ; A. S. Klusener |
| title_full_unstemmed | A verification of the Bakery protocol combining algebraic and model-oriented techniques C. Brovedani ; A. S. Klusener |
| title_short | A verification of the Bakery protocol combining algebraic and model-oriented techniques |
| title_sort | a verification of the bakery protocol combining algebraic and model oriented techniques |
| topic | Abstract data types (Computer science) Computer network protocols Proof theory Prozessalgebra (DE-588)4283920-8 gnd |
| topic_facet | Abstract data types (Computer science) Computer network protocols Proof theory Prozessalgebra Forschungsbericht |
| work_keys_str_mv | AT brovedaniclaudia averificationofthebakeryprotocolcombiningalgebraicandmodelorientedtechniques AT klusenerasteven averificationofthebakeryprotocolcombiningalgebraicandmodelorientedtechniques |