Computable processes and bisimulation equivalence:
Abstract: "A process is 'computable' if it can be modelled by a transition system that has a recursive structure. The equivalence relation between transition systems considered is bisimulation. As a means for defining transition systems (modulo bisimulation), the specification languag...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1992
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,7 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A process is 'computable' if it can be modelled by a transition system that has a recursive structure. The equivalence relation between transition systems considered is bisimulation. As a means for defining transition systems (modulo bisimulation), the specification language [mu]CRL (micro Common Representation Language) is used. Two simple fragments of [mu]CRL are singled out, yielding universal expressivity with respect to recursive and primitive recursive transition systems over a fixed, finite label set For all transition systems defined by a [mu]CRL specification over the recursive fragment, and for the class of all primitive recursive transition systems over some finite label set, the properties 'bisimilarity', 'deadlock freedom' and 'regularity' (i.e., having a bisimilar finite representation) are classified in the arithmetical hierarchy. Finally it is shown that in the domain of primitive recursive transition systems over a fixed, finite label set, a genuine hierarchy in bisimilarity can be defined via the complexity of the witnessing relations. |
| Beschreibung: | 28 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008756 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27670702 | ||
| 035 | |a (DE-599)BVBBV009008756 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Ponse, Alban |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computable processes and bisimulation equivalence |c A. Ponse |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 28 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 92,7 | |
| 520 | 3 | |a Abstract: "A process is 'computable' if it can be modelled by a transition system that has a recursive structure. The equivalence relation between transition systems considered is bisimulation. As a means for defining transition systems (modulo bisimulation), the specification language [mu]CRL (micro Common Representation Language) is used. Two simple fragments of [mu]CRL are singled out, yielding universal expressivity with respect to recursive and primitive recursive transition systems over a fixed, finite label set | |
| 520 | 3 | |a For all transition systems defined by a [mu]CRL specification over the recursive fragment, and for the class of all primitive recursive transition systems over some finite label set, the properties 'bisimilarity', 'deadlock freedom' and 'regularity' (i.e., having a bisimilar finite representation) are classified in the arithmetical hierarchy. Finally it is shown that in the domain of primitive recursive transition systems over a fixed, finite label set, a genuine hierarchy in bisimilarity can be defined via the complexity of the witnessing relations. | |
| 650 | 4 | |a Operator algebras | |
| 650 | 4 | |a Operator theory | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,7 |w (DE-604)BV008928356 |9 92,7 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005955243 | ||
Datensatz im Suchindex
| _version_ | 1804123355903688704 |
|---|---|
| any_adam_object | |
| author | Ponse, Alban |
| author_facet | Ponse, Alban |
| author_role | aut |
| author_sort | Ponse, Alban |
| author_variant | a p ap |
| building | Verbundindex |
| bvnumber | BV009008756 |
| ctrlnum | (OCoLC)27670702 (DE-599)BVBBV009008756 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02069nam a2200313 cb4500</leader><controlfield tag="001">BV009008756</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27670702</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008756</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">Ponse, Alban</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computable processes and bisimulation equivalence</subfield><subfield code="c">A. Ponse</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 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">92,7</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A process is 'computable' if it can be modelled by a transition system that has a recursive structure. The equivalence relation between transition systems considered is bisimulation. As a means for defining transition systems (modulo bisimulation), the specification language [mu]CRL (micro Common Representation Language) is used. Two simple fragments of [mu]CRL are singled out, yielding universal expressivity with respect to recursive and primitive recursive transition systems over a fixed, finite label set</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">For all transition systems defined by a [mu]CRL specification over the recursive fragment, and for the class of all primitive recursive transition systems over some finite label set, the properties 'bisimilarity', 'deadlock freedom' and 'regularity' (i.e., having a bisimilar finite representation) are classified in the arithmetical hierarchy. Finally it is shown that in the domain of primitive recursive transition systems over a fixed, finite label set, a genuine hierarchy in bisimilarity can be defined via the complexity of the witnessing relations.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operator algebras</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operator theory</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">92,7</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,7</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955243</subfield></datafield></record></collection> |
| id | DE-604.BV009008756 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955243 |
| oclc_num | 27670702 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 28 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Ponse, Alban Verfasser aut Computable processes and bisimulation equivalence A. Ponse Amsterdam 1992 28 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,7 Abstract: "A process is 'computable' if it can be modelled by a transition system that has a recursive structure. The equivalence relation between transition systems considered is bisimulation. As a means for defining transition systems (modulo bisimulation), the specification language [mu]CRL (micro Common Representation Language) is used. Two simple fragments of [mu]CRL are singled out, yielding universal expressivity with respect to recursive and primitive recursive transition systems over a fixed, finite label set For all transition systems defined by a [mu]CRL specification over the recursive fragment, and for the class of all primitive recursive transition systems over some finite label set, the properties 'bisimilarity', 'deadlock freedom' and 'regularity' (i.e., having a bisimilar finite representation) are classified in the arithmetical hierarchy. Finally it is shown that in the domain of primitive recursive transition systems over a fixed, finite label set, a genuine hierarchy in bisimilarity can be defined via the complexity of the witnessing relations. Operator algebras Operator theory Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,7 (DE-604)BV008928356 92,7 |
| spellingShingle | Ponse, Alban Computable processes and bisimulation equivalence Operator algebras Operator theory |
| title | Computable processes and bisimulation equivalence |
| title_auth | Computable processes and bisimulation equivalence |
| title_exact_search | Computable processes and bisimulation equivalence |
| title_full | Computable processes and bisimulation equivalence A. Ponse |
| title_fullStr | Computable processes and bisimulation equivalence A. Ponse |
| title_full_unstemmed | Computable processes and bisimulation equivalence A. Ponse |
| title_short | Computable processes and bisimulation equivalence |
| title_sort | computable processes and bisimulation equivalence |
| topic | Operator algebras Operator theory |
| topic_facet | Operator algebras Operator theory |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT ponsealban computableprocessesandbisimulationequivalence |