Expressiveness results for process algebras:
Abstract: "The expressive power of process algebras is investigated in a general setting of structural operational semantics. The notion of an effective operational semantics is introduced and it is observed that no effective operational semantics for an enumerable language can specify all effe...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1993
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,1 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The expressive power of process algebras is investigated in a general setting of structural operational semantics. The notion of an effective operational semantics is introduced and it is observed that no effective operational semantics for an enumerable language can specify all effective process graphs up to trace equivalence. A natural class of Plotkin style SOS specifications is identified, containing the guarded versions of calculi like CCS, SCCS, MEIJE and ACP, and it is proved that any specification in this class induces an effective operational semantics Using techniques introduced by Bloom, it is shown that for the guarded vesions of CCS-like calculi, there is a double exponential bound on the speed with which the number of outgoing transitions in a state can grow. As a corollary of this result it follows that two expressiveness results of De Simone for MEIJE and SCCS depend in a fundamental way on the use of unguarded recursion. A final result of this paper is that all operators definable via a finite number of rules in a format due to De Simone, are derived operators in the simple process calculus PC. |
| Beschreibung: | 30 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009033866 | ||
| 003 | DE-604 | ||
| 005 | 19950427 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31237729 | ||
| 035 | |a (DE-599)BVBBV009033866 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Vaandrager, Frits W. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Expressiveness results for process algebras |c Frits W. Vaandrager |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 30 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,1 | |
| 520 | 3 | |a Abstract: "The expressive power of process algebras is investigated in a general setting of structural operational semantics. The notion of an effective operational semantics is introduced and it is observed that no effective operational semantics for an enumerable language can specify all effective process graphs up to trace equivalence. A natural class of Plotkin style SOS specifications is identified, containing the guarded versions of calculi like CCS, SCCS, MEIJE and ACP, and it is proved that any specification in this class induces an effective operational semantics | |
| 520 | 3 | |a Using techniques introduced by Bloom, it is shown that for the guarded vesions of CCS-like calculi, there is a double exponential bound on the speed with which the number of outgoing transitions in a state can grow. As a corollary of this result it follows that two expressiveness results of De Simone for MEIJE and SCCS depend in a fundamental way on the use of unguarded recursion. A final result of this paper is that all operators definable via a finite number of rules in a format due to De Simone, are derived operators in the simple process calculus PC. | |
| 650 | 4 | |a Algebra | |
| 650 | 4 | |a Semantics | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,1 |w (DE-604)BV008928356 |9 93,1 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005976654 | ||
Datensatz im Suchindex
| _version_ | 1804123387365163008 |
|---|---|
| any_adam_object | |
| author | Vaandrager, Frits W. |
| author_facet | Vaandrager, Frits W. |
| author_role | aut |
| author_sort | Vaandrager, Frits W. |
| author_variant | f w v fw fwv |
| building | Verbundindex |
| bvnumber | BV009033866 |
| ctrlnum | (OCoLC)31237729 (DE-599)BVBBV009033866 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02125nam a2200313 cb4500</leader><controlfield tag="001">BV009033866</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950427 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31237729</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009033866</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">Vaandrager, Frits W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Expressiveness results for process algebras</subfield><subfield code="c">Frits W. Vaandrager</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">30 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,1</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The expressive power of process algebras is investigated in a general setting of structural operational semantics. The notion of an effective operational semantics is introduced and it is observed that no effective operational semantics for an enumerable language can specify all effective process graphs up to trace equivalence. A natural class of Plotkin style SOS specifications is identified, containing the guarded versions of calculi like CCS, SCCS, MEIJE and ACP, and it is proved that any specification in this class induces an effective operational semantics</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Using techniques introduced by Bloom, it is shown that for the guarded vesions of CCS-like calculi, there is a double exponential bound on the speed with which the number of outgoing transitions in a state can grow. As a corollary of this result it follows that two expressiveness results of De Simone for MEIJE and SCCS depend in a fundamental way on the use of unguarded recursion. A final result of this paper is that all operators definable via a finite number of rules in a format due to De Simone, are derived operators in the simple process calculus PC.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semantics</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,1</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005976654</subfield></datafield></record></collection> |
| id | DE-604.BV009033866 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005976654 |
| oclc_num | 31237729 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 30 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Vaandrager, Frits W. Verfasser aut Expressiveness results for process algebras Frits W. Vaandrager Amsterdam 1993 30 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,1 Abstract: "The expressive power of process algebras is investigated in a general setting of structural operational semantics. The notion of an effective operational semantics is introduced and it is observed that no effective operational semantics for an enumerable language can specify all effective process graphs up to trace equivalence. A natural class of Plotkin style SOS specifications is identified, containing the guarded versions of calculi like CCS, SCCS, MEIJE and ACP, and it is proved that any specification in this class induces an effective operational semantics Using techniques introduced by Bloom, it is shown that for the guarded vesions of CCS-like calculi, there is a double exponential bound on the speed with which the number of outgoing transitions in a state can grow. As a corollary of this result it follows that two expressiveness results of De Simone for MEIJE and SCCS depend in a fundamental way on the use of unguarded recursion. A final result of this paper is that all operators definable via a finite number of rules in a format due to De Simone, are derived operators in the simple process calculus PC. Algebra Semantics Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,1 (DE-604)BV008928356 93,1 |
| spellingShingle | Vaandrager, Frits W. Expressiveness results for process algebras Algebra Semantics |
| title | Expressiveness results for process algebras |
| title_auth | Expressiveness results for process algebras |
| title_exact_search | Expressiveness results for process algebras |
| title_full | Expressiveness results for process algebras Frits W. Vaandrager |
| title_fullStr | Expressiveness results for process algebras Frits W. Vaandrager |
| title_full_unstemmed | Expressiveness results for process algebras Frits W. Vaandrager |
| title_short | Expressiveness results for process algebras |
| title_sort | expressiveness results for process algebras |
| topic | Algebra Semantics |
| topic_facet | Algebra Semantics |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT vaandragerfritsw expressivenessresultsforprocessalgebras |