The tyft/tyxt format reduces to tree rules:
Abstract: "Groote and Vaandrager [5] introduced the tyft/tyxt format for transition system specifications (TSSs), and established that, for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt for...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1993
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,67 |
| Subjects: | |
| Summary: | Abstract: "Groote and Vaandrager [5] introduced the tyft/tyxt format for transition system specifications (TSSs), and established that, for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of [5] can be dropped. These results extend to tyft/tyxt with negative premises and predicates." |
| Physical Description: | 13 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010177431 | ||
| 003 | DE-604 | ||
| 005 | 19951130 | ||
| 007 | t | ||
| 008 | 950511s1993 |||| 00||| engod | ||
| 035 | |a (OCoLC)31372956 | ||
| 035 | |a (DE-599)BVBBV010177431 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Fokkink, Willem J. |d 1965- |e Verfasser |0 (DE-588)121536831 |4 aut | |
| 245 | 1 | 0 | |a The tyft/tyxt format reduces to tree rules |c W. J. Fokkink |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 13 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 93,67 | |
| 520 | 3 | |a Abstract: "Groote and Vaandrager [5] introduced the tyft/tyxt format for transition system specifications (TSSs), and established that, for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of [5] can be dropped. These results extend to tyft/tyxt with negative premises and predicates." | |
| 650 | 4 | |a Computer programming | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,67 |w (DE-604)BV008928356 |9 93,67 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006759967 | ||
Record in the Search Index
| _version_ | 1804124575235047424 |
|---|---|
| any_adam_object | |
| author | Fokkink, Willem J. 1965- |
| author_GND | (DE-588)121536831 |
| author_facet | Fokkink, Willem J. 1965- |
| author_role | aut |
| author_sort | Fokkink, Willem J. 1965- |
| author_variant | w j f wj wjf |
| building | Verbundindex |
| bvnumber | BV010177431 |
| ctrlnum | (OCoLC)31372956 (DE-599)BVBBV010177431 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01547nam a2200277 cb4500</leader><controlfield tag="001">BV010177431</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19951130 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950511s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31372956</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010177431</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="100" ind1="1" ind2=" "><subfield code="a">Fokkink, Willem J.</subfield><subfield code="d">1965-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121536831</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The tyft/tyxt format reduces to tree rules</subfield><subfield code="c">W. J. Fokkink</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">93,67</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Groote and Vaandrager [5] introduced the tyft/tyxt format for transition system specifications (TSSs), and established that, for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of [5] can be dropped. These results extend to tyft/tyxt with negative premises and predicates."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">93,67</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,67</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006759967</subfield></datafield></record></collection> |
| id | DE-604.BV010177431 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006759967 |
| oclc_num | 31372956 |
| open_access_boolean | |
| physical | 13 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Fokkink, Willem J. 1965- Verfasser (DE-588)121536831 aut The tyft/tyxt format reduces to tree rules W. J. Fokkink Amsterdam 1993 13 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,67 Abstract: "Groote and Vaandrager [5] introduced the tyft/tyxt format for transition system specifications (TSSs), and established that, for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of [5] can be dropped. These results extend to tyft/tyxt with negative premises and predicates." Computer programming Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,67 (DE-604)BV008928356 93,67 |
| spellingShingle | Fokkink, Willem J. 1965- The tyft/tyxt format reduces to tree rules Computer programming |
| title | The tyft/tyxt format reduces to tree rules |
| title_auth | The tyft/tyxt format reduces to tree rules |
| title_exact_search | The tyft/tyxt format reduces to tree rules |
| title_full | The tyft/tyxt format reduces to tree rules W. J. Fokkink |
| title_fullStr | The tyft/tyxt format reduces to tree rules W. J. Fokkink |
| title_full_unstemmed | The tyft/tyxt format reduces to tree rules W. J. Fokkink |
| title_short | The tyft/tyxt format reduces to tree rules |
| title_sort | the tyft tyxt format reduces to tree rules |
| topic | Computer programming |
| topic_facet | Computer programming |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT fokkinkwillemj thetyfttyxtformatreducestotreerules |