Congruence proofs for weak bisimulation on higher order processes: results for typed omega-order calculi
Abstract: "Congruence proofs for bisimulation on higher-order process calculi tend to be significantly more complex than their counterparts in first-order process algebra frameworks. Moreover, a standard technique that allows us to cover strong forms of bisimulation on higher-order calculi seem...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Berlin
Techn. Univ. Berlin, Fachbereich 13, Informatik
1996
|
| Schriftenreihe: | Technische Universität <Berlin> / Fachbereich Informatik: Bericht
[19]96,19 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Congruence proofs for bisimulation on higher-order process calculi tend to be significantly more complex than their counterparts in first-order process algebra frameworks. Moreover, a standard technique that allows us to cover strong forms of bisimulation on higher-order calculi seems to fail for the corresponding weak forms. Similar problems are posed by applicative simulation on [lambda]-calculi and our starting point is a general and elegant technique for solving them that has been invented by Howe. We adapt and extend this technique for solving them that has been invented by Howe. We adapt and extend this technique to prove two new congruence results for [omega]-order process calculi. In the first case, where we use a static scoping discipline for action names, we treat a delay variant of late weak context bisimulation; in the second case, where we use a dynamic scoping discipline, we treat an early weak higher-order bisimulation. The present paper supersedes parts of our technical report [BF95], where we have considered second-order processes." |
| Beschreibung: | Literaturverz. Bl. 31 - 33 |
| Beschreibung: | 33 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010938386 | ||
| 003 | DE-604 | ||
| 005 | 19960920 | ||
| 007 | t | ||
| 008 | 960902s1996 gw |||| 00||| ger d | ||
| 016 | 7 | |a 948326271 |2 DE-101 | |
| 035 | |a (OCoLC)35916532 | ||
| 035 | |a (DE-599)BVBBV010938386 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-83 | ||
| 100 | 1 | |a Frauenstein, Thomas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Congruence proofs for weak bisimulation on higher order processes |b results for typed omega-order calculi |c Thomas Frauenstein ; Michael Baldamus ; Rainer Glas |
| 264 | 1 | |a Berlin |b Techn. Univ. Berlin, Fachbereich 13, Informatik |c 1996 | |
| 300 | |a 33 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <Berlin> / Fachbereich Informatik: Bericht |v [19]96,19 | |
| 500 | |a Literaturverz. Bl. 31 - 33 | ||
| 520 | 3 | |a Abstract: "Congruence proofs for bisimulation on higher-order process calculi tend to be significantly more complex than their counterparts in first-order process algebra frameworks. Moreover, a standard technique that allows us to cover strong forms of bisimulation on higher-order calculi seems to fail for the corresponding weak forms. Similar problems are posed by applicative simulation on [lambda]-calculi and our starting point is a general and elegant technique for solving them that has been invented by Howe. We adapt and extend this technique for solving them that has been invented by Howe. We adapt and extend this technique to prove two new congruence results for [omega]-order process calculi. In the first case, where we use a static scoping discipline for action names, we treat a delay variant of late weak context bisimulation; in the second case, where we use a dynamic scoping discipline, we treat an early weak higher-order bisimulation. The present paper supersedes parts of our technical report [BF95], where we have considered second-order processes." | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Programming languages (Electronic computers) | |
| 650 | 4 | |a Proof theory | |
| 700 | 1 | |a Baldamus, Michael |e Verfasser |4 aut | |
| 700 | 1 | |a Glas, Rainer |e Verfasser |4 aut | |
| 810 | 2 | |a Fachbereich Informatik: Bericht |t Technische Universität <Berlin> |v [19]96,19 |w (DE-604)BV000001083 |9 1996,19 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007316727 | ||
Datensatz im Suchindex
| _version_ | 1804125427663372288 |
|---|---|
| any_adam_object | |
| author | Frauenstein, Thomas Baldamus, Michael Glas, Rainer |
| author_facet | Frauenstein, Thomas Baldamus, Michael Glas, Rainer |
| author_role | aut aut aut |
| author_sort | Frauenstein, Thomas |
| author_variant | t f tf m b mb r g rg |
| building | Verbundindex |
| bvnumber | BV010938386 |
| ctrlnum | (OCoLC)35916532 (DE-599)BVBBV010938386 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02436nam a2200373 cb4500</leader><controlfield tag="001">BV010938386</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960920 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960902s1996 gw |||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">948326271</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35916532</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010938386</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">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Frauenstein, Thomas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Congruence proofs for weak bisimulation on higher order processes</subfield><subfield code="b">results for typed omega-order calculi</subfield><subfield code="c">Thomas Frauenstein ; Michael Baldamus ; Rainer Glas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Techn. Univ. Berlin, Fachbereich 13, Informatik</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">33 Bl.</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 <Berlin> / Fachbereich Informatik: Bericht</subfield><subfield code="v">[19]96,19</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. Bl. 31 - 33</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Congruence proofs for bisimulation on higher-order process calculi tend to be significantly more complex than their counterparts in first-order process algebra frameworks. Moreover, a standard technique that allows us to cover strong forms of bisimulation on higher-order calculi seems to fail for the corresponding weak forms. Similar problems are posed by applicative simulation on [lambda]-calculi and our starting point is a general and elegant technique for solving them that has been invented by Howe. We adapt and extend this technique for solving them that has been invented by Howe. We adapt and extend this technique to prove two new congruence results for [omega]-order process calculi. In the first case, where we use a static scoping discipline for action names, we treat a delay variant of late weak context bisimulation; in the second case, where we use a dynamic scoping discipline, we treat an early weak higher-order bisimulation. The present paper supersedes parts of our technical report [BF95], where we have considered second-order processes."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Baldamus, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Glas, Rainer</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fachbereich Informatik: Bericht</subfield><subfield code="t">Technische Universität <Berlin></subfield><subfield code="v">[19]96,19</subfield><subfield code="w">(DE-604)BV000001083</subfield><subfield code="9">1996,19</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007316727</subfield></datafield></record></collection> |
| id | DE-604.BV010938386 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:23Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007316727 |
| oclc_num | 35916532 |
| open_access_boolean | |
| owner | DE-12 DE-83 |
| owner_facet | DE-12 DE-83 |
| physical | 33 Bl. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Techn. Univ. Berlin, Fachbereich 13, Informatik |
| record_format | marc |
| series2 | Technische Universität <Berlin> / Fachbereich Informatik: Bericht |
| spelling | Frauenstein, Thomas Verfasser aut Congruence proofs for weak bisimulation on higher order processes results for typed omega-order calculi Thomas Frauenstein ; Michael Baldamus ; Rainer Glas Berlin Techn. Univ. Berlin, Fachbereich 13, Informatik 1996 33 Bl. txt rdacontent n rdamedia nc rdacarrier Technische Universität <Berlin> / Fachbereich Informatik: Bericht [19]96,19 Literaturverz. Bl. 31 - 33 Abstract: "Congruence proofs for bisimulation on higher-order process calculi tend to be significantly more complex than their counterparts in first-order process algebra frameworks. Moreover, a standard technique that allows us to cover strong forms of bisimulation on higher-order calculi seems to fail for the corresponding weak forms. Similar problems are posed by applicative simulation on [lambda]-calculi and our starting point is a general and elegant technique for solving them that has been invented by Howe. We adapt and extend this technique for solving them that has been invented by Howe. We adapt and extend this technique to prove two new congruence results for [omega]-order process calculi. In the first case, where we use a static scoping discipline for action names, we treat a delay variant of late weak context bisimulation; in the second case, where we use a dynamic scoping discipline, we treat an early weak higher-order bisimulation. The present paper supersedes parts of our technical report [BF95], where we have considered second-order processes." Logic, Symbolic and mathematical Programming languages (Electronic computers) Proof theory Baldamus, Michael Verfasser aut Glas, Rainer Verfasser aut Fachbereich Informatik: Bericht Technische Universität <Berlin> [19]96,19 (DE-604)BV000001083 1996,19 |
| spellingShingle | Frauenstein, Thomas Baldamus, Michael Glas, Rainer Congruence proofs for weak bisimulation on higher order processes results for typed omega-order calculi Logic, Symbolic and mathematical Programming languages (Electronic computers) Proof theory |
| title | Congruence proofs for weak bisimulation on higher order processes results for typed omega-order calculi |
| title_auth | Congruence proofs for weak bisimulation on higher order processes results for typed omega-order calculi |
| title_exact_search | Congruence proofs for weak bisimulation on higher order processes results for typed omega-order calculi |
| title_full | Congruence proofs for weak bisimulation on higher order processes results for typed omega-order calculi Thomas Frauenstein ; Michael Baldamus ; Rainer Glas |
| title_fullStr | Congruence proofs for weak bisimulation on higher order processes results for typed omega-order calculi Thomas Frauenstein ; Michael Baldamus ; Rainer Glas |
| title_full_unstemmed | Congruence proofs for weak bisimulation on higher order processes results for typed omega-order calculi Thomas Frauenstein ; Michael Baldamus ; Rainer Glas |
| title_short | Congruence proofs for weak bisimulation on higher order processes |
| title_sort | congruence proofs for weak bisimulation on higher order processes results for typed omega order calculi |
| title_sub | results for typed omega-order calculi |
| topic | Logic, Symbolic and mathematical Programming languages (Electronic computers) Proof theory |
| topic_facet | Logic, Symbolic and mathematical Programming languages (Electronic computers) Proof theory |
| volume_link | (DE-604)BV000001083 |
| work_keys_str_mv | AT frauensteinthomas congruenceproofsforweakbisimulationonhigherorderprocessesresultsfortypedomegaordercalculi AT baldamusmichael congruenceproofsforweakbisimulationonhigherorderprocessesresultsfortypedomegaordercalculi AT glasrainer congruenceproofsforweakbisimulationonhigherorderprocessesresultsfortypedomegaordercalculi |