Bisimulations and predicate logic:
Abstract: "Elementary (first-order) and non-elementary (set- theoretic) aspects of the largest bisimulation are considered, with a view towards analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an exten...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1993
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,33 |
| Subjects: | |
| Summary: | Abstract: "Elementary (first-order) and non-elementary (set- theoretic) aspects of the largest bisimulation are considered, with a view towards analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an extensional notion of equivalence on programs (or processes) generalizing input/output equivalence (at a cost exceeding [pi][superscript 1][subscript 1] over certain transition predicates computable in log space), and (ii) as a tool for analyzing the dependence of transitions on data (which can be shown to be elementary or non-elementary, depending on the formulation of the transitions). These ways contrast not only in the logical dependence they uncover, but also in their use of sets as abstractions describing mechanical computation." |
| Physical Description: | 15 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009034597 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31042286 | ||
| 035 | |a (DE-599)BVBBV009034597 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Fernando, R. T. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Bisimulations and predicate logic |c R. T. P. Fernando |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 15 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,33 | |
| 520 | 3 | |a Abstract: "Elementary (first-order) and non-elementary (set- theoretic) aspects of the largest bisimulation are considered, with a view towards analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an extensional notion of equivalence on programs (or processes) generalizing input/output equivalence (at a cost exceeding [pi][superscript 1][subscript 1] over certain transition predicates computable in log space), and (ii) as a tool for analyzing the dependence of transitions on data (which can be shown to be elementary or non-elementary, depending on the formulation of the transitions). These ways contrast not only in the logical dependence they uncover, but also in their use of sets as abstractions describing mechanical computation." | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,33 |w (DE-604)BV008928356 |9 93,33 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005977149 | ||
Record in the Search Index
| _version_ | 1804123387995357184 |
|---|---|
| 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 | BV009034597 |
| ctrlnum | (OCoLC)31042286 (DE-599)BVBBV009034597 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01817nam a2200301 cb4500</leader><controlfield tag="001">BV009034597</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31042286</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009034597</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">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">Bisimulations and predicate logic</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">15 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,33</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Elementary (first-order) and non-elementary (set- theoretic) aspects of the largest bisimulation are considered, with a view towards analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an extensional notion of equivalence on programs (or processes) generalizing input/output equivalence (at a cost exceeding [pi][superscript 1][subscript 1] over certain transition predicates computable in log space), and (ii) as a tool for analyzing the dependence of transitions on data (which can be shown to be elementary or non-elementary, depending on the formulation of the transitions). These ways contrast not only in the logical dependence they uncover, but also in their use of sets as abstractions describing mechanical computation."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</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,33</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,33</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005977149</subfield></datafield></record></collection> |
| id | DE-604.BV009034597 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005977149 |
| oclc_num | 31042286 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 15 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 Bisimulations and predicate logic R. T. P. Fernando Amsterdam 1993 15 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,33 Abstract: "Elementary (first-order) and non-elementary (set- theoretic) aspects of the largest bisimulation are considered, with a view towards analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an extensional notion of equivalence on programs (or processes) generalizing input/output equivalence (at a cost exceeding [pi][superscript 1][subscript 1] over certain transition predicates computable in log space), and (ii) as a tool for analyzing the dependence of transitions on data (which can be shown to be elementary or non-elementary, depending on the formulation of the transitions). These ways contrast not only in the logical dependence they uncover, but also in their use of sets as abstractions describing mechanical computation." Künstliche Intelligenz Artificial intelligence Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,33 (DE-604)BV008928356 93,33 |
| spellingShingle | Fernando, R. T. Bisimulations and predicate logic Künstliche Intelligenz Artificial intelligence |
| title | Bisimulations and predicate logic |
| title_auth | Bisimulations and predicate logic |
| title_exact_search | Bisimulations and predicate logic |
| title_full | Bisimulations and predicate logic R. T. P. Fernando |
| title_fullStr | Bisimulations and predicate logic R. T. P. Fernando |
| title_full_unstemmed | Bisimulations and predicate logic R. T. P. Fernando |
| title_short | Bisimulations and predicate logic |
| title_sort | bisimulations and predicate logic |
| topic | Künstliche Intelligenz Artificial intelligence |
| topic_facet | Künstliche Intelligenz Artificial intelligence |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT fernandort bisimulationsandpredicatelogic |