Advanced topics in bisimulation and coinduction:
Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic a...
Saved in:
| Other Authors: | , |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
2012
|
| Series: | Cambridge tracts in theoretical computer science
52 |
| Subjects: | |
| Online Access: | BSB01 FHN01 Volltext |
| Summary: | Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material |
| Item Description: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Physical Description: | 1 online resource (xiii, 326 pages) |
| ISBN: | 9780511792588 |
| DOI: | 10.1017/CBO9780511792588 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043941412 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2012 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511792588 |c Online |9 978-0-511-79258-8 | ||
| 024 | 7 | |a 10.1017/CBO9780511792588 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511792588 | ||
| 035 | |a (OCoLC)852518127 | ||
| 035 | |a (DE-599)BVBBV043941412 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 004.01/5113 |2 23 | |
| 084 | |a ST 125 |0 (DE-625)143586: |2 rvk | ||
| 245 | 1 | 0 | |a Advanced topics in bisimulation and coinduction |c edited by Davide Sangiorgi, Jan Rutten |
| 246 | 1 | 3 | |a Advanced Topics in Bisimulation & Coinduction |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2012 | |
| 300 | |a 1 online resource (xiii, 326 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge tracts in theoretical computer science |v 52 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | 0 | |g 1 |t Origins of bisimulation and coinduction |r Davide Sangiorgi |g 2 |t An introduction to (co)algebra and (co)induction |r Bart Jacobs and Jan Rutten |g 3 |t The algorithmics of bisimilarity |r Luca Aceto, Anna Ingolfsdottir and Jiři; Srba |g 4 |t Bisimulation and logic |r Colin Stirling |g 5 |t Howe's method for higher-order languages |r Andrew Pitts |g 6 |t Enhancements of the bisimulation proof method |r Damien Pous and Davide Sangiorgi |g 7 |g Probabilistic bisimulation |r Prakash Panangaden |
| 520 | |a Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material | ||
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Bisimulation | |
| 650 | 4 | |a Coinduction (Mathematics) | |
| 650 | 4 | |a Modality (Logic) | |
| 650 | 4 | |a Induction (Mathematics) | |
| 650 | 4 | |a Computer science | |
| 650 | 0 | 7 | |a Induktion |0 (DE-588)4026765-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Bisimulation |0 (DE-588)4619739-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Bisimulation |0 (DE-588)4619739-4 |D s |
| 689 | 0 | 1 | |a Induktion |0 (DE-588)4026765-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Sangiorgi, Davide |4 edt | |
| 700 | 1 | |a Rutten, J. J. M. M. |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-1-107-00497-9 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511792588 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350382 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511792588 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511792588 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804176883098583040 |
|---|---|
| any_adam_object | |
| author2 | Sangiorgi, Davide Rutten, J. J. M. M. |
| author2_role | edt edt |
| author2_variant | d s ds j j m m r jjmm jjmmr |
| author_additional | Davide Sangiorgi Bart Jacobs and Jan Rutten Luca Aceto, Anna Ingolfsdottir and Jiři; Srba Colin Stirling Andrew Pitts Damien Pous and Davide Sangiorgi Prakash Panangaden |
| author_facet | Sangiorgi, Davide Rutten, J. J. M. M. |
| building | Verbundindex |
| bvnumber | BV043941412 |
| classification_rvk | ST 125 |
| collection | ZDB-20-CBO |
| contents | Origins of bisimulation and coinduction An introduction to (co)algebra and (co)induction The algorithmics of bisimilarity Bisimulation and logic Howe's method for higher-order languages Enhancements of the bisimulation proof method |
| ctrlnum | (ZDB-20-CBO)CR9780511792588 (OCoLC)852518127 (DE-599)BVBBV043941412 |
| dewey-full | 004.01/5113 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.01/5113 |
| dewey-search | 004.01/5113 |
| dewey-sort | 14.01 45113 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1017/CBO9780511792588 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03585nmm a2200577zcb4500</leader><controlfield tag="001">BV043941412</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2012 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511792588</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-79258-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511792588</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511792588</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)852518127</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941412</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.01/5113</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 125</subfield><subfield code="0">(DE-625)143586:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Advanced topics in bisimulation and coinduction</subfield><subfield code="c">edited by Davide Sangiorgi, Jan Rutten</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Advanced Topics in Bisimulation & Coinduction</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 326 pages)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">52</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="g">1</subfield><subfield code="t">Origins of bisimulation and coinduction</subfield><subfield code="r">Davide Sangiorgi</subfield><subfield code="g">2</subfield><subfield code="t">An introduction to (co)algebra and (co)induction</subfield><subfield code="r">Bart Jacobs and Jan Rutten</subfield><subfield code="g">3</subfield><subfield code="t">The algorithmics of bisimilarity</subfield><subfield code="r">Luca Aceto, Anna Ingolfsdottir and Jiři; Srba</subfield><subfield code="g">4</subfield><subfield code="t">Bisimulation and logic</subfield><subfield code="r">Colin Stirling</subfield><subfield code="g">5</subfield><subfield code="t">Howe's method for higher-order languages</subfield><subfield code="r">Andrew Pitts</subfield><subfield code="g">6</subfield><subfield code="t">Enhancements of the bisimulation proof method</subfield><subfield code="r">Damien Pous and Davide Sangiorgi</subfield><subfield code="g">7</subfield><subfield code="g">Probabilistic bisimulation</subfield><subfield code="r">Prakash Panangaden</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bisimulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coinduction (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Modality (Logic)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Induction (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Induktion</subfield><subfield code="0">(DE-588)4026765-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Bisimulation</subfield><subfield code="0">(DE-588)4619739-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Bisimulation</subfield><subfield code="0">(DE-588)4619739-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Induktion</subfield><subfield code="0">(DE-588)4026765-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sangiorgi, Davide</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rutten, J. J. M. M.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-1-107-00497-9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511792588</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029350382</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511792588</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511792588</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043941412 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:15Z |
| institution | BVB |
| isbn | 9780511792588 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350382 |
| oclc_num | 852518127 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xiii, 326 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Advanced topics in bisimulation and coinduction edited by Davide Sangiorgi, Jan Rutten Advanced Topics in Bisimulation & Coinduction Cambridge Cambridge University Press 2012 1 online resource (xiii, 326 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in theoretical computer science 52 Title from publisher's bibliographic system (viewed on 05 Oct 2015) 1 Origins of bisimulation and coinduction Davide Sangiorgi 2 An introduction to (co)algebra and (co)induction Bart Jacobs and Jan Rutten 3 The algorithmics of bisimilarity Luca Aceto, Anna Ingolfsdottir and Jiři; Srba 4 Bisimulation and logic Colin Stirling 5 Howe's method for higher-order languages Andrew Pitts 6 Enhancements of the bisimulation proof method Damien Pous and Davide Sangiorgi 7 Probabilistic bisimulation Prakash Panangaden Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material Informatik Bisimulation Coinduction (Mathematics) Modality (Logic) Induction (Mathematics) Computer science Induktion (DE-588)4026765-9 gnd rswk-swf Bisimulation (DE-588)4619739-4 gnd rswk-swf Bisimulation (DE-588)4619739-4 s Induktion (DE-588)4026765-9 s 1\p DE-604 Sangiorgi, Davide edt Rutten, J. J. M. M. edt Erscheint auch als Druckausgabe 978-1-107-00497-9 https://doi.org/10.1017/CBO9780511792588 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Advanced topics in bisimulation and coinduction Origins of bisimulation and coinduction An introduction to (co)algebra and (co)induction The algorithmics of bisimilarity Bisimulation and logic Howe's method for higher-order languages Enhancements of the bisimulation proof method Informatik Bisimulation Coinduction (Mathematics) Modality (Logic) Induction (Mathematics) Computer science Induktion (DE-588)4026765-9 gnd Bisimulation (DE-588)4619739-4 gnd |
| subject_GND | (DE-588)4026765-9 (DE-588)4619739-4 |
| title | Advanced topics in bisimulation and coinduction |
| title_alt | Advanced Topics in Bisimulation & Coinduction Origins of bisimulation and coinduction An introduction to (co)algebra and (co)induction The algorithmics of bisimilarity Bisimulation and logic Howe's method for higher-order languages Enhancements of the bisimulation proof method |
| title_auth | Advanced topics in bisimulation and coinduction |
| title_exact_search | Advanced topics in bisimulation and coinduction |
| title_full | Advanced topics in bisimulation and coinduction edited by Davide Sangiorgi, Jan Rutten |
| title_fullStr | Advanced topics in bisimulation and coinduction edited by Davide Sangiorgi, Jan Rutten |
| title_full_unstemmed | Advanced topics in bisimulation and coinduction edited by Davide Sangiorgi, Jan Rutten |
| title_short | Advanced topics in bisimulation and coinduction |
| title_sort | advanced topics in bisimulation and coinduction |
| topic | Informatik Bisimulation Coinduction (Mathematics) Modality (Logic) Induction (Mathematics) Computer science Induktion (DE-588)4026765-9 gnd Bisimulation (DE-588)4619739-4 gnd |
| topic_facet | Informatik Bisimulation Coinduction (Mathematics) Modality (Logic) Induction (Mathematics) Computer science Induktion |
| url | https://doi.org/10.1017/CBO9780511792588 |
| work_keys_str_mv | AT sangiorgidavide advancedtopicsinbisimulationandcoinduction AT ruttenjjmm advancedtopicsinbisimulationandcoinduction AT sangiorgidavide advancedtopicsinbisimulationcoinduction AT ruttenjjmm advancedtopicsinbisimulationcoinduction |