Explicit canonical representatives for weak bisimulation equivalence and congruence:
Abstract: "A labelled transition system is considered having as labels a set of actions containing [tau], the silent move. Both for strong- and weak-bisimulation equivalence a model is defined that maps every state of the system to a canonical representative of its equivalence class. The latter...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1990
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS
90,62 |
| Subjects: | |
| Online Access: | Volltext |
| Summary: | Abstract: "A labelled transition system is considered having as labels a set of actions containing [tau], the silent move. Both for strong- and weak-bisimulation equivalence a model is defined that maps every state of the system to a canonical representative of its equivalence class. The latter model is obtained as an abstraction of the former. The main contribution is the fact that not only the existence of such representatives is established but that, moreover, an explicit (recursively defined) description is provided. The use of a (recursive) domain equation for the construction of tree-like structures, which are used for these representatives, is crucial." |
| Physical Description: | 20 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008974438 | ||
| 003 | DE-604 | ||
| 005 | 20220228 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24021675 | ||
| 035 | |a (DE-599)BVBBV008974438 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Rutten, J. J. M. M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Explicit canonical representatives for weak bisimulation equivalence and congruence |c J. J. M. M. Rutten |
| 264 | 1 | |a Amsterdam |c 1990 | |
| 300 | |a 20 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |v 90,62 | |
| 520 | 3 | |a Abstract: "A labelled transition system is considered having as labels a set of actions containing [tau], the silent move. Both for strong- and weak-bisimulation equivalence a model is defined that maps every state of the system to a canonical representative of its equivalence class. The latter model is obtained as an abstraction of the former. The main contribution is the fact that not only the existence of such representatives is established but that, moreover, an explicit (recursively defined) description is provided. The use of a (recursive) domain equation for the construction of tree-like structures, which are used for these representatives, is crucial." | |
| 650 | 4 | |a Programming languages (Electronic computers) |x Semantics | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |
| 830 | 0 | |a Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |v 90,62 |w (DE-604)BV008928356 |9 90,62 | |
| 856 | 4 | 1 | |u https://ir.cwi.nl/pub/5653 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005926012 | ||
Record in the Search Index
| _version_ | 1804123312472719360 |
|---|---|
| any_adam_object | |
| author | Rutten, J. J. M. M. |
| author_facet | Rutten, J. J. M. M. |
| author_role | aut |
| author_sort | Rutten, J. J. M. M. |
| author_variant | j j m m r jjmm jjmmr |
| building | Verbundindex |
| bvnumber | BV008974438 |
| collection | ebook |
| ctrlnum | (OCoLC)24021675 (DE-599)BVBBV008974438 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01854nam a2200325 cb4500</leader><controlfield tag="001">BV008974438</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24021675</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974438</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><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rutten, J. J. M. M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Explicit canonical representatives for weak bisimulation equivalence and congruence</subfield><subfield code="c">J. J. M. M. Rutten</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 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">Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS</subfield><subfield code="v">90,62</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A labelled transition system is considered having as labels a set of actions containing [tau], the silent move. Both for strong- and weak-bisimulation equivalence a model is defined that maps every state of the system to a canonical representative of its equivalence class. The latter model is obtained as an abstraction of the former. The main contribution is the fact that not only the existence of such representatives is established but that, moreover, an explicit (recursively defined) description is provided. The use of a (recursive) domain equation for the construction of tree-like structures, which are used for these representatives, is crucial."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield><subfield code="x">Semantics</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS</subfield><subfield code="v">90,62</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,62</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5653</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926012</subfield></datafield></record></collection> |
| id | DE-604.BV008974438 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926012 |
| oclc_num | 24021675 |
| open_access_boolean | 1 |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 20 S. |
| psigel | ebook |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |
| spelling | Rutten, J. J. M. M. Verfasser aut Explicit canonical representatives for weak bisimulation equivalence and congruence J. J. M. M. Rutten Amsterdam 1990 20 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,62 Abstract: "A labelled transition system is considered having as labels a set of actions containing [tau], the silent move. Both for strong- and weak-bisimulation equivalence a model is defined that maps every state of the system to a canonical representative of its equivalence class. The latter model is obtained as an abstraction of the former. The main contribution is the fact that not only the existence of such representatives is established but that, moreover, an explicit (recursively defined) description is provided. The use of a (recursive) domain equation for the construction of tree-like structures, which are used for these representatives, is crucial." Programming languages (Electronic computers) Semantics Erscheint auch als Online-Ausgabe Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,62 (DE-604)BV008928356 90,62 https://ir.cwi.nl/pub/5653 Verlag kostenfrei Volltext |
| spellingShingle | Rutten, J. J. M. M. Explicit canonical representatives for weak bisimulation equivalence and congruence Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS Programming languages (Electronic computers) Semantics |
| title | Explicit canonical representatives for weak bisimulation equivalence and congruence |
| title_auth | Explicit canonical representatives for weak bisimulation equivalence and congruence |
| title_exact_search | Explicit canonical representatives for weak bisimulation equivalence and congruence |
| title_full | Explicit canonical representatives for weak bisimulation equivalence and congruence J. J. M. M. Rutten |
| title_fullStr | Explicit canonical representatives for weak bisimulation equivalence and congruence J. J. M. M. Rutten |
| title_full_unstemmed | Explicit canonical representatives for weak bisimulation equivalence and congruence J. J. M. M. Rutten |
| title_short | Explicit canonical representatives for weak bisimulation equivalence and congruence |
| title_sort | explicit canonical representatives for weak bisimulation equivalence and congruence |
| topic | Programming languages (Electronic computers) Semantics |
| topic_facet | Programming languages (Electronic computers) Semantics |
| url | https://ir.cwi.nl/pub/5653 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT ruttenjjmm explicitcanonicalrepresentativesforweakbisimulationequivalenceandcongruence |