Undecidable equivalences for basic process algebra:
Abstract: "A recent theorem [3, 7, 15] shows that strong bisimilarity is decidable for the class of normed BPA processes, which correspond to context-free grammars. In [16] Huynh and Tian have shown that readiness and failure equivalence are undecidable for BPA processes. In this paper we exami...
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,37 |
| Subjects: | |
| Summary: | Abstract: "A recent theorem [3, 7, 15] shows that strong bisimilarity is decidable for the class of normed BPA processes, which correspond to context-free grammars. In [16] Huynh and Tian have shown that readiness and failure equivalence are undecidable for BPA processes. In this paper we examine all other equivalences in the linear/branching time hierarchy [10] and show that none of them are decidable for normed BPA processes." |
| Physical Description: | 16 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008992676 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25511976 | ||
| 035 | |a (DE-599)BVBBV008992676 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Groote, Jan F. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Undecidable equivalences for basic process algebra |c J. F. Groote ; H. Hüttel |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 16 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,37 | |
| 520 | 3 | |a Abstract: "A recent theorem [3, 7, 15] shows that strong bisimilarity is decidable for the class of normed BPA processes, which correspond to context-free grammars. In [16] Huynh and Tian have shown that readiness and failure equivalence are undecidable for BPA processes. In this paper we examine all other equivalences in the linear/branching time hierarchy [10] and show that none of them are decidable for normed BPA processes." | |
| 650 | 4 | |a Automata theory | |
| 650 | 4 | |a Process control | |
| 700 | 1 | |a Hüttel, Hans |e Verfasser |0 (DE-588)125975260 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,37 |w (DE-604)BV008928356 |9 91,37 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941598 | ||
Record in the Search Index
| _version_ | 1804123335127203840 |
|---|---|
| any_adam_object | |
| author | Groote, Jan F. Hüttel, Hans |
| author_GND | (DE-588)125975260 |
| author_facet | Groote, Jan F. Hüttel, Hans |
| author_role | aut aut |
| author_sort | Groote, Jan F. |
| author_variant | j f g jf jfg h h hh |
| building | Verbundindex |
| bvnumber | BV008992676 |
| ctrlnum | (OCoLC)25511976 (DE-599)BVBBV008992676 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01491nam a2200313 cb4500</leader><controlfield tag="001">BV008992676</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)25511976</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992676</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">Groote, Jan F.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Undecidable equivalences for basic process algebra</subfield><subfield code="c">J. F. Groote ; H. Hüttel</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">16 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,37</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A recent theorem [3, 7, 15] shows that strong bisimilarity is decidable for the class of normed BPA processes, which correspond to context-free grammars. In [16] Huynh and Tian have shown that readiness and failure equivalence are undecidable for BPA processes. In this paper we examine all other equivalences in the linear/branching time hierarchy [10] and show that none of them are decidable for normed BPA processes."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automata theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Process control</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hüttel, Hans</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)125975260</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,37</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,37</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941598</subfield></datafield></record></collection> |
| id | DE-604.BV008992676 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941598 |
| oclc_num | 25511976 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 16 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Groote, Jan F. Verfasser aut Undecidable equivalences for basic process algebra J. F. Groote ; H. Hüttel Amsterdam 1991 16 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,37 Abstract: "A recent theorem [3, 7, 15] shows that strong bisimilarity is decidable for the class of normed BPA processes, which correspond to context-free grammars. In [16] Huynh and Tian have shown that readiness and failure equivalence are undecidable for BPA processes. In this paper we examine all other equivalences in the linear/branching time hierarchy [10] and show that none of them are decidable for normed BPA processes." Automata theory Process control Hüttel, Hans Verfasser (DE-588)125975260 aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,37 (DE-604)BV008928356 91,37 |
| spellingShingle | Groote, Jan F. Hüttel, Hans Undecidable equivalences for basic process algebra Automata theory Process control |
| title | Undecidable equivalences for basic process algebra |
| title_auth | Undecidable equivalences for basic process algebra |
| title_exact_search | Undecidable equivalences for basic process algebra |
| title_full | Undecidable equivalences for basic process algebra J. F. Groote ; H. Hüttel |
| title_fullStr | Undecidable equivalences for basic process algebra J. F. Groote ; H. Hüttel |
| title_full_unstemmed | Undecidable equivalences for basic process algebra J. F. Groote ; H. Hüttel |
| title_short | Undecidable equivalences for basic process algebra |
| title_sort | undecidable equivalences for basic process algebra |
| topic | Automata theory Process control |
| topic_facet | Automata theory Process control |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT grootejanf undecidableequivalencesforbasicprocessalgebra AT huttelhans undecidableequivalencesforbasicprocessalgebra |