Term rewriting analysis in process algebra:
Abstract: "We discuss the application of term rewriting analysis to theories of communicating concurrent systems. Turning such a theory into a canonical term rewriting system yields decidability and is essential for implementation. We do this for the theory ACP with a silent step in the setting...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1991
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,30 |
| Subjects: | |
| Summary: | Abstract: "We discuss the application of term rewriting analysis to theories of communicating concurrent systems. Turning such a theory into a canonical term rewriting system yields decidability and is essential for implementation. We do this for the theory ACP with a silent step in the setting of branching bisimulation. It is necessary to consider rewriting modulo equalities. The article has the following structure: After the introduction and a list of definitions, we consider in section 3 Knuth-Bendix completion. In section 4, we consider a Peterson-Stickel complete term rewriting system which has the same term algebra as the fragment of ACP[superscript tau] it corresponds with. In section 5, we prove termination of this rewrite system." |
| Physical Description: | 9 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008992672 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25511944 | ||
| 035 | |a (DE-599)BVBBV008992672 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Akkerman, G. J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Term rewriting analysis in process algebra |c G. J. Akkerman ; J. C. M. Baeten |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 9 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 91,30 | |
| 520 | 3 | |a Abstract: "We discuss the application of term rewriting analysis to theories of communicating concurrent systems. Turning such a theory into a canonical term rewriting system yields decidability and is essential for implementation. We do this for the theory ACP with a silent step in the setting of branching bisimulation. It is necessary to consider rewriting modulo equalities. The article has the following structure: After the introduction and a list of definitions, we consider in section 3 Knuth-Bendix completion. In section 4, we consider a Peterson-Stickel complete term rewriting system which has the same term algebra as the fragment of ACP[superscript tau] it corresponds with. In section 5, we prove termination of this rewrite system." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Baeten, Josephus C. M. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,30 |w (DE-604)BV008928356 |9 91,30 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941594 | ||
Record in the Search Index
| _version_ | 1804123335136641024 |
|---|---|
| any_adam_object | |
| author | Akkerman, G. J. Baeten, Josephus C. M. |
| author_facet | Akkerman, G. J. Baeten, Josephus C. M. |
| author_role | aut aut |
| author_sort | Akkerman, G. J. |
| author_variant | g j a gj gja j c m b jcm jcmb |
| building | Verbundindex |
| bvnumber | BV008992672 |
| ctrlnum | (OCoLC)25511944 (DE-599)BVBBV008992672 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01786nam a2200301 cb4500</leader><controlfield tag="001">BV008992672</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25511944</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992672</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="100" ind1="1" ind2=" "><subfield code="a">Akkerman, G. J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Term rewriting analysis in process algebra</subfield><subfield code="c">G. J. Akkerman ; J. C. M. Baeten</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 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">91,30</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We discuss the application of term rewriting analysis to theories of communicating concurrent systems. Turning such a theory into a canonical term rewriting system yields decidability and is essential for implementation. We do this for the theory ACP with a silent step in the setting of branching bisimulation. It is necessary to consider rewriting modulo equalities. The article has the following structure: After the introduction and a list of definitions, we consider in section 3 Knuth-Bendix completion. In section 4, we consider a Peterson-Stickel complete term rewriting system which has the same term algebra as the fragment of ACP[superscript tau] it corresponds with. In section 5, we prove termination of this rewrite system."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Baeten, Josephus C. M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">91,30</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,30</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941594</subfield></datafield></record></collection> |
| id | DE-604.BV008992672 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941594 |
| oclc_num | 25511944 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 9 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Akkerman, G. J. Verfasser aut Term rewriting analysis in process algebra G. J. Akkerman ; J. C. M. Baeten Amsterdam 1991 9 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,30 Abstract: "We discuss the application of term rewriting analysis to theories of communicating concurrent systems. Turning such a theory into a canonical term rewriting system yields decidability and is essential for implementation. We do this for the theory ACP with a silent step in the setting of branching bisimulation. It is necessary to consider rewriting modulo equalities. The article has the following structure: After the introduction and a list of definitions, we consider in section 3 Knuth-Bendix completion. In section 4, we consider a Peterson-Stickel complete term rewriting system which has the same term algebra as the fragment of ACP[superscript tau] it corresponds with. In section 5, we prove termination of this rewrite system." Rewriting systems (Computer science) Baeten, Josephus C. M. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,30 (DE-604)BV008928356 91,30 |
| spellingShingle | Akkerman, G. J. Baeten, Josephus C. M. Term rewriting analysis in process algebra Rewriting systems (Computer science) |
| title | Term rewriting analysis in process algebra |
| title_auth | Term rewriting analysis in process algebra |
| title_exact_search | Term rewriting analysis in process algebra |
| title_full | Term rewriting analysis in process algebra G. J. Akkerman ; J. C. M. Baeten |
| title_fullStr | Term rewriting analysis in process algebra G. J. Akkerman ; J. C. M. Baeten |
| title_full_unstemmed | Term rewriting analysis in process algebra G. J. Akkerman ; J. C. M. Baeten |
| title_short | Term rewriting analysis in process algebra |
| title_sort | term rewriting analysis in process algebra |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT akkermangj termrewritinganalysisinprocessalgebra AT baetenjosephuscm termrewritinganalysisinprocessalgebra |