Turning SOS rules into equations:
Abstract: "Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly wit...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1992
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,18 |
| Subjects: | |
| Summary: | Abstract: "Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes." |
| Physical Description: | 44 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008753 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27670716 | ||
| 035 | |a (DE-599)BVBBV009008753 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Aceto, Luca |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Turning SOS rules into equations |c L. Aceto ; B. Bloom ; F. W. Vaandrager |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 44 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,18 | |
| 520 | 3 | |a Abstract: "Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes." | |
| 650 | 4 | |a Computer programming | |
| 700 | 1 | |a Bloom, Bard |e Verfasser |4 aut | |
| 700 | 1 | |a Vaandrager, Frits W. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,18 |w (DE-604)BV008928356 |9 92,18 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005955240 | ||
Record in the Search Index
| _version_ | 1804123355894251520 |
|---|---|
| any_adam_object | |
| author | Aceto, Luca Bloom, Bard Vaandrager, Frits W. |
| author_facet | Aceto, Luca Bloom, Bard Vaandrager, Frits W. |
| author_role | aut aut aut |
| author_sort | Aceto, Luca |
| author_variant | l a la b b bb f w v fw fwv |
| building | Verbundindex |
| bvnumber | BV009008753 |
| ctrlnum | (OCoLC)27670716 (DE-599)BVBBV009008753 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01453nam a2200313 cb4500</leader><controlfield tag="001">BV009008753</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)27670716</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008753</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">Aceto, Luca</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Turning SOS rules into equations</subfield><subfield code="c">L. Aceto ; B. Bloom ; F. W. Vaandrager</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">44 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,18</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bloom, Bard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vaandrager, Frits W.</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">92,18</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,18</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955240</subfield></datafield></record></collection> |
| id | DE-604.BV009008753 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955240 |
| oclc_num | 27670716 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 44 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Aceto, Luca Verfasser aut Turning SOS rules into equations L. Aceto ; B. Bloom ; F. W. Vaandrager Amsterdam 1992 44 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,18 Abstract: "Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes." Computer programming Bloom, Bard Verfasser aut Vaandrager, Frits W. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,18 (DE-604)BV008928356 92,18 |
| spellingShingle | Aceto, Luca Bloom, Bard Vaandrager, Frits W. Turning SOS rules into equations Computer programming |
| title | Turning SOS rules into equations |
| title_auth | Turning SOS rules into equations |
| title_exact_search | Turning SOS rules into equations |
| title_full | Turning SOS rules into equations L. Aceto ; B. Bloom ; F. W. Vaandrager |
| title_fullStr | Turning SOS rules into equations L. Aceto ; B. Bloom ; F. W. Vaandrager |
| title_full_unstemmed | Turning SOS rules into equations L. Aceto ; B. Bloom ; F. W. Vaandrager |
| title_short | Turning SOS rules into equations |
| title_sort | turning sos rules into equations |
| topic | Computer programming |
| topic_facet | Computer programming |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT acetoluca turningsosrulesintoequations AT bloombard turningsosrulesintoequations AT vaandragerfritsw turningsosrulesintoequations |