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...
Gespeichert in:
| Weitere beteiligte Personen: | , |
|---|---|
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2012
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
52 |
| Links: | https://doi.org/10.1017/CBO9780511792588 |
| Zusammenfassung: | 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. |
| Umfang: | 1 Online-Ressource (xiii, 326 Seiten) |
| ISBN: | 9780511792588 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511792588 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020621.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 100624s2012||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511792588 | ||
| 245 | 0 | 0 | |a Advanced topics in bisimulation and coinduction |c edited by Davide Sangiorgi, Jan Rutten |
| 246 | 3 | |a Advanced Topics in Bisimulation & Coinduction | |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2012 | |
| 300 | |a 1 Online-Ressource (xiii, 326 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Cambridge tracts in theoretical computer science |v 52 | |
| 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. | ||
| 700 | 1 | |a Rutten, J. J. M. M. | |
| 700 | 1 | |a Sangiorgi, Davide | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781107004979 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511792588 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511792588 |
|---|---|
| _version_ | 1825574049823064065 |
| adam_text | |
| any_adam_object | |
| author2 | Rutten, J. J. M. M. Sangiorgi, Davide |
| author2_role | |
| author2_variant | j j m m r jjmm jjmmr d s ds |
| author_facet | Rutten, J. J. M. M. Sangiorgi, Davide |
| author_sort | Rutten, J. J. M. M. |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01808nam a2200277 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511792588</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020621.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">100624s2012||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511792588</subfield></datafield><datafield tag="245" ind1="0" 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="3" ind2=" "><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-Ressource (xiii, 326 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">52</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="700" ind1="1" ind2=" "><subfield code="a">Rutten, J. J. M. M.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sangiorgi, Davide</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781107004979</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511792588</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9780511792588 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:03Z |
| institution | BVB |
| isbn | 9780511792588 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xiii, 326 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| 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-Ressource (xiii, 326 Seiten) txt c cr Cambridge tracts in theoretical computer science 52 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. Rutten, J. J. M. M. Sangiorgi, Davide Erscheint auch als Druck-Ausgabe 9781107004979 |
| spellingShingle | Advanced topics in bisimulation and coinduction |
| title | Advanced topics in bisimulation and coinduction |
| title_alt | Advanced Topics in Bisimulation & Coinduction |
| 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 |
| work_keys_str_mv | AT ruttenjjmm advancedtopicsinbisimulationandcoinduction AT sangiorgidavide advancedtopicsinbisimulationandcoinduction AT ruttenjjmm advancedtopicsinbisimulationcoinduction AT sangiorgidavide advancedtopicsinbisimulationcoinduction |