Operational semantics, bisimulations and logical complexity:
Abstract: "A logical analysis of operational semantics based on the notion of a bisimulation is considered, and the explosion in logical complexity triggered by bisimulations on computable transition predicates is investigated in relation to certain algebraic styles of reasoning. A 'univer...
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,55 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A logical analysis of operational semantics based on the notion of a bisimulation is considered, and the explosion in logical complexity triggered by bisimulations on computable transition predicates is investigated in relation to certain algebraic styles of reasoning. A 'universal mechanical' transition predicate is isolated, accomodating transition predicates departing in essential ways from those underlying various models from denotational semantics. Objections commonly raised against bisimulations (e.g., that bisimilarity is too fine, or that it may fail to be a congruence, or that it is based on transition graphs reducing parallelism to interleaving) are disputed, resting (as these do) on unfortunate choices of transition predicates For while a bisimulation presupposes a fixed transition predicate, there are a multitude of such predicates, representing (for instance) different levels of abstraction, including input/output equivalence, which, in the context of partial equivalence relations, is presented (below) as a bisimulation. |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010176729 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950510s1993 |||| 00||| engod | ||
| 035 | |a (OCoLC)31237738 | ||
| 035 | |a (DE-599)BVBBV010176729 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Fernando, R. T. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Operational semantics, bisimulations and logical complexity |c R. T. P. Fernando |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 12 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,55 | |
| 520 | 3 | |a Abstract: "A logical analysis of operational semantics based on the notion of a bisimulation is considered, and the explosion in logical complexity triggered by bisimulations on computable transition predicates is investigated in relation to certain algebraic styles of reasoning. A 'universal mechanical' transition predicate is isolated, accomodating transition predicates departing in essential ways from those underlying various models from denotational semantics. Objections commonly raised against bisimulations (e.g., that bisimilarity is too fine, or that it may fail to be a congruence, or that it is based on transition graphs reducing parallelism to interleaving) are disputed, resting (as these do) on unfortunate choices of transition predicates | |
| 520 | 3 | |a For while a bisimulation presupposes a fixed transition predicate, there are a multitude of such predicates, representing (for instance) different levels of abstraction, including input/output equivalence, which, in the context of partial equivalence relations, is presented (below) as a bisimulation. | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Semantics | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,55 |w (DE-604)BV008928356 |9 93,55 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006759376 | ||
Datensatz im Suchindex
| _version_ | 1804124574323834880 |
|---|---|
| any_adam_object | |
| author | Fernando, R. T. |
| author_facet | Fernando, R. T. |
| author_role | aut |
| author_sort | Fernando, R. T. |
| author_variant | r t f rt rtf |
| building | Verbundindex |
| bvnumber | BV010176729 |
| ctrlnum | (OCoLC)31237738 (DE-599)BVBBV010176729 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02060nam a2200301 cb4500</leader><controlfield tag="001">BV010176729</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950510s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31237738</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010176729</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="100" ind1="1" ind2=" "><subfield code="a">Fernando, R. T.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Operational semantics, bisimulations and logical complexity</subfield><subfield code="c">R. T. P. Fernando</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">12 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,55</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A logical analysis of operational semantics based on the notion of a bisimulation is considered, and the explosion in logical complexity triggered by bisimulations on computable transition predicates is investigated in relation to certain algebraic styles of reasoning. A 'universal mechanical' transition predicate is isolated, accomodating transition predicates departing in essential ways from those underlying various models from denotational semantics. Objections commonly raised against bisimulations (e.g., that bisimilarity is too fine, or that it may fail to be a congruence, or that it is based on transition graphs reducing parallelism to interleaving) are disputed, resting (as these do) on unfortunate choices of transition predicates</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">For while a bisimulation presupposes a fixed transition predicate, there are a multitude of such predicates, representing (for instance) different levels of abstraction, including input/output equivalence, which, in the context of partial equivalence relations, is presented (below) as a bisimulation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</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,55</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,55</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006759376</subfield></datafield></record></collection> |
| id | DE-604.BV010176729 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006759376 |
| oclc_num | 31237738 |
| open_access_boolean | |
| physical | 12 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Fernando, R. T. Verfasser aut Operational semantics, bisimulations and logical complexity R. T. P. Fernando Amsterdam 1993 12 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,55 Abstract: "A logical analysis of operational semantics based on the notion of a bisimulation is considered, and the explosion in logical complexity triggered by bisimulations on computable transition predicates is investigated in relation to certain algebraic styles of reasoning. A 'universal mechanical' transition predicate is isolated, accomodating transition predicates departing in essential ways from those underlying various models from denotational semantics. Objections commonly raised against bisimulations (e.g., that bisimilarity is too fine, or that it may fail to be a congruence, or that it is based on transition graphs reducing parallelism to interleaving) are disputed, resting (as these do) on unfortunate choices of transition predicates For while a bisimulation presupposes a fixed transition predicate, there are a multitude of such predicates, representing (for instance) different levels of abstraction, including input/output equivalence, which, in the context of partial equivalence relations, is presented (below) as a bisimulation. Logic, Symbolic and mathematical Semantics Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,55 (DE-604)BV008928356 93,55 |
| spellingShingle | Fernando, R. T. Operational semantics, bisimulations and logical complexity Logic, Symbolic and mathematical Semantics |
| title | Operational semantics, bisimulations and logical complexity |
| title_auth | Operational semantics, bisimulations and logical complexity |
| title_exact_search | Operational semantics, bisimulations and logical complexity |
| title_full | Operational semantics, bisimulations and logical complexity R. T. P. Fernando |
| title_fullStr | Operational semantics, bisimulations and logical complexity R. T. P. Fernando |
| title_full_unstemmed | Operational semantics, bisimulations and logical complexity R. T. P. Fernando |
| title_short | Operational semantics, bisimulations and logical complexity |
| title_sort | operational semantics bisimulations and logical complexity |
| topic | Logic, Symbolic and mathematical Semantics |
| topic_facet | Logic, Symbolic and mathematical Semantics |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT fernandort operationalsemanticsbisimulationsandlogicalcomplexity |