A complete axiomatization for branching bisimulation congruence of finite-state behaviours:
Abstract: "This paper offers a complete inference system for branching bisimulation congruence on a basic sublanguage of CCS for representing regular processes with silent moves. Moreover, complete axiomatizations are provided for the guarded expressions in this language, representing the diver...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1993
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1470 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper offers a complete inference system for branching bisimulation congruence on a basic sublanguage of CCS for representing regular processes with silent moves. Moreover, complete axiomatizations are provided for the guarded expressions in this language, representing the divergence-free processes, and for the recursion-free expressions, representing the finite processes. Furthermore it is argued that in abstract interleaving semantics (at least for finite processes) branching bisimulation congruence is the finest reasonable congruence possible The argument is that for closed recursion-free process expressions, in the presence of some standard process algebra operations like partially synchronous parallel composition and relabelling, branching bisimulation congruence is completely axiomatized by the usual axioms for strong congruence together with Milner's first [rho]-law a[rho]X = aX. |
| Beschreibung: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009034283 | ||
| 003 | DE-604 | ||
| 005 | 19990318 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)30498417 | ||
| 035 | |a (DE-599)BVBBV009034283 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA76.952 | |
| 100 | 1 | |a Glabbeek, Rob van |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A complete axiomatization for branching bisimulation congruence of finite-state behaviours |c by Robert J. van Glabbeek |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a 15 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1470 | |
| 520 | 3 | |a Abstract: "This paper offers a complete inference system for branching bisimulation congruence on a basic sublanguage of CCS for representing regular processes with silent moves. Moreover, complete axiomatizations are provided for the guarded expressions in this language, representing the divergence-free processes, and for the recursion-free expressions, representing the finite processes. Furthermore it is argued that in abstract interleaving semantics (at least for finite processes) branching bisimulation congruence is the finest reasonable congruence possible | |
| 520 | 3 | |a The argument is that for closed recursion-free process expressions, in the presence of some standard process algebra operations like partially synchronous parallel composition and relabelling, branching bisimulation congruence is completely axiomatized by the usual axioms for strong congruence together with Milner's first [rho]-law a[rho]X = aX. | |
| 650 | 4 | |a Concurrent programming | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1470 |w (DE-604)BV008928280 |9 1470 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005976950 | ||
Datensatz im Suchindex
| _version_ | 1804123387719581696 |
|---|---|
| any_adam_object | |
| author | Glabbeek, Rob van |
| author_facet | Glabbeek, Rob van |
| author_role | aut |
| author_sort | Glabbeek, Rob van |
| author_variant | r v g rv rvg |
| building | Verbundindex |
| bvnumber | BV009034283 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.952 |
| callnumber-search | QA76.952 |
| callnumber-sort | QA 276.952 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)30498417 (DE-599)BVBBV009034283 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01922nam a2200313 cb4500</leader><controlfield tag="001">BV009034283</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19990318 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30498417</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009034283</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-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.952</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Glabbeek, Rob van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A complete axiomatization for branching bisimulation congruence of finite-state behaviours</subfield><subfield code="c">by Robert J. van Glabbeek</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 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="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1470</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper offers a complete inference system for branching bisimulation congruence on a basic sublanguage of CCS for representing regular processes with silent moves. Moreover, complete axiomatizations are provided for the guarded expressions in this language, representing the divergence-free processes, and for the recursion-free expressions, representing the finite processes. Furthermore it is argued that in abstract interleaving semantics (at least for finite processes) branching bisimulation congruence is the finest reasonable congruence possible</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The argument is that for closed recursion-free process expressions, in the presence of some standard process algebra operations like partially synchronous parallel composition and relabelling, branching bisimulation congruence is completely axiomatized by the usual axioms for strong congruence together with Milner's first [rho]-law a[rho]X = aX.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Concurrent programming</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1470</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1470</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005976950</subfield></datafield></record></collection> |
| id | DE-604.BV009034283 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005976950 |
| oclc_num | 30498417 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 15 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Glabbeek, Rob van Verfasser aut A complete axiomatization for branching bisimulation congruence of finite-state behaviours by Robert J. van Glabbeek Stanford, Calif. 1993 15 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1470 Abstract: "This paper offers a complete inference system for branching bisimulation congruence on a basic sublanguage of CCS for representing regular processes with silent moves. Moreover, complete axiomatizations are provided for the guarded expressions in this language, representing the divergence-free processes, and for the recursion-free expressions, representing the finite processes. Furthermore it is argued that in abstract interleaving semantics (at least for finite processes) branching bisimulation congruence is the finest reasonable congruence possible The argument is that for closed recursion-free process expressions, in the presence of some standard process algebra operations like partially synchronous parallel composition and relabelling, branching bisimulation congruence is completely axiomatized by the usual axioms for strong congruence together with Milner's first [rho]-law a[rho]X = aX. Concurrent programming Computer Science Department: Report STAN CS Stanford University 1470 (DE-604)BV008928280 1470 |
| spellingShingle | Glabbeek, Rob van A complete axiomatization for branching bisimulation congruence of finite-state behaviours Concurrent programming |
| title | A complete axiomatization for branching bisimulation congruence of finite-state behaviours |
| title_auth | A complete axiomatization for branching bisimulation congruence of finite-state behaviours |
| title_exact_search | A complete axiomatization for branching bisimulation congruence of finite-state behaviours |
| title_full | A complete axiomatization for branching bisimulation congruence of finite-state behaviours by Robert J. van Glabbeek |
| title_fullStr | A complete axiomatization for branching bisimulation congruence of finite-state behaviours by Robert J. van Glabbeek |
| title_full_unstemmed | A complete axiomatization for branching bisimulation congruence of finite-state behaviours by Robert J. van Glabbeek |
| title_short | A complete axiomatization for branching bisimulation congruence of finite-state behaviours |
| title_sort | a complete axiomatization for branching bisimulation congruence of finite state behaviours |
| topic | Concurrent programming |
| topic_facet | Concurrent programming |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT glabbeekrobvan acompleteaxiomatizationforbranchingbisimulationcongruenceoffinitestatebehaviours |