Advanced Topics in Bisimulation and Coinduction.:
Seven articles survey the state of the art. Discusses various aspects of the subject, with an emphasis on process theory.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge :
Cambridge University Press,
2011.
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Seven articles survey the state of the art. Discusses various aspects of the subject, with an emphasis on process theory. |
| Beschreibung: | 6.2.1 Diagram-based enhancements. |
| Beschreibung: | 1 online resource (342 pages) |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781139159340 1139159348 9781107004979 1107004977 9780511792588 0511792581 9781139161398 1139161393 |
Internformat
MARC
| LEADER | 00000cam a2200000Mu 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn763159247 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 111128s2011 enk ob 001 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d OCLCQ |d IDEBK |d CDX |d COO |d YDXCP |d OCLCQ |d AUD |d OCLCO |d OCLCF |d DEBSZ |d OCLCQ |d UPM |d OSU |d N$T |d E7B |d UIU |d CAMBR |d OCLCQ |d S3O |d OCLCQ |d LIP |d OCLCQ |d UUM |d OCLCQ |d OL$ |d OCLCQ |d OCLCO |d OCLCQ |d OCL |d OCLCO |d OCLCL |d OCLCQ | ||
| 066 | |c (S | ||
| 019 | |a 766418136 |a 773039053 |a 793601239 |a 990542880 |a 1014252299 |a 1167582958 |a 1264977236 | ||
| 020 | |a 9781139159340 | ||
| 020 | |a 1139159348 | ||
| 020 | |a 9781107004979 |q (Cloth) | ||
| 020 | |a 1107004977 |q (Cloth) | ||
| 020 | |a 9780511792588 |q (electronic bk.) | ||
| 020 | |a 0511792581 |q (electronic bk.) | ||
| 020 | |a 9781139161398 |q (electronic bk.) | ||
| 020 | |a 1139161393 |q (electronic bk.) | ||
| 024 | 8 | |a 9786613342454 | |
| 035 | |a (OCoLC)763159247 |z (OCoLC)766418136 |z (OCoLC)773039053 |z (OCoLC)793601239 |z (OCoLC)990542880 |z (OCoLC)1014252299 |z (OCoLC)1167582958 |z (OCoLC)1264977236 | ||
| 037 | |a 334245 |b MIL | ||
| 050 | 4 | |a QA76.9.A96 | |
| 072 | 7 | |a COM |x 013000 |2 bisacsh | |
| 072 | 7 | |a COM |x 014000 |2 bisacsh | |
| 072 | 7 | |a COM |x 018000 |2 bisacsh | |
| 072 | 7 | |a COM |x 067000 |2 bisacsh | |
| 072 | 7 | |a COM |x 032000 |2 bisacsh | |
| 072 | 7 | |a COM |x 037000 |2 bisacsh | |
| 072 | 7 | |a COM |x 052000 |2 bisacsh | |
| 082 | 7 | |a 004.151 | |
| 084 | |a COM043000 |2 bisacsh | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Sangiorgi, Davide. | |
| 245 | 1 | 0 | |a Advanced Topics in Bisimulation and Coinduction. |
| 260 | |a Cambridge : |b Cambridge University Press, |c 2011. | ||
| 300 | |a 1 online resource (342 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Cambridge Tracts in Theoretical Computer Science ; |v v. 52 | |
| 505 | 0 | |a Cover; Cambridge Tracts in Theoretical Computer Science 52; Title; Copyright; Contents; Contributors; Preface; 1 Origins of bisimulation and coinduction; 1.1 Introduction; 1.2 Bisimulation in modal logic; 1.2.1 Modal logics; 1.2.2 From homomorphism to p-morphism; 1.2.3 Johan van Benthem; 1.2.4 Discussion; 1.3 Bisimulation in computer science; 1.3.1 Algebraic theory of automata; 1.3.2 Robin Milner; 1.3.3 David Park; 1.3.4 Discussion; 1.4 Set theory; 1.4.1 Non-well-founded sets; 1.4.2 The stratified approach to set theory; 1.4.3 Non-well-founded sets and extensionality. | |
| 505 | 8 | |a 1.4.4 Marco Forti and Furio Honsell1.4.5 Peter Aczel; 1.4.6 Jon Barwise; 1.4.7 Extensionality quotients: Roland Hinnion and others; 1.4.8 Discussion; 1.5 The introduction of fixed points in computer science; 1.6 Fixed-point theorems; Bibliography; 2 An introduction to (co)algebra and (co)induction; 2.1 Introduction; 2.2 Algebraic and coalgebraic phenomena; 2.3 Inductive and coinductive definitions; 2.4 Functoriality of products, coproducts and powersets; 2.5 Algebras and induction; 2.6 Coalgebras and coinduction; 2.7 Proofs by coinduction and bisimulation; 2.8 Processes coalgebraically. | |
| 505 | 8 | |a 2.9 Trace semantics, coalgebraically2.10 Exercises; Bibliography; 3 The algorithmics of bisimilarity; 3.1 Introduction; 3.2 Classical algorithms for bisimilarity; 3.2.1 Preliminaries; 3.2.2 The algorithm of Kanellakis and Smolka; 3.2.3 The algorithm of Paige and Tarjan; 3.2.4 Computing bisimilarity, symbolically; 3.2.5 Checking weak equivalences; 3.3 The complexity of checking bisimilarityover finite processes; 3.3.1 Game characterisation of bisimulation-like relations; 3.3.2 Deciding bisimilarity over finite labelledtransition systems is P-complete. | |
| 505 | 8 | |a 3.3.3 EXPTIME-completeness of equivalence checking on networks of finite processes3.4 Decidability results for bisimilarity overinfinite-state systems; 3.4.1 Process rewrite systems; 3.4.2 Deciding bisimilarity on BPP using a tableau technique; 3.4.3 Undecidability of bisimilarity on Petri nets; 3.4.4 Overview of results; 3.5 The use of bisimilarity checking in verification and tools; 3.5.1 Some uses of bisimilarity checking; 3.5.2 Concluding remarks; Bibliography; 4 Bisimulation and logic; 4.1 Introduction; 4.2 Modal logic and bisimilarity; 4.3 Bisimulation invariance; 4.4 Modal mu-calculus. | |
| 505 | 8 | |a 4.5 Monadic second-order logic and bisimulation invarianceBibliography; 5 Howe's method for higher-order languages; 5.1 Introduction; 5.2 Call-by-value?-calculus; 5.3 Applicative (bi)similarity for call-by-value?-calculus; 5.4 Congruence; 5.5 Howe's construction; 5.6 Contextual equivalence; 5.7 The transitive closure trick; 5.8 CIU-equivalence; 5.9 Call-by-name equivalences; 5.10 Summary; 5.11 Assessment; Bibliography; 6 Enhancements of the bisimulation proof method; 6.1 The need for enhancements; 6.1.1 The bisimulation game; 6.1.2 Tracking redundancies; 6.2 Examples of enhancements. | |
| 500 | |a 6.2.1 Diagram-based enhancements. | ||
| 520 | |a Seven articles survey the state of the art. Discusses various aspects of the subject, with an emphasis on process theory. | ||
| 504 | |a Includes bibliographical references and index. | ||
| 588 | 0 | |a Print version record. | |
| 546 | |a English. | ||
| 650 | 0 | |a Computer simulation. |0 http://id.loc.gov/authorities/subjects/sh85029533 | |
| 650 | 0 | |a Computer science |x Philosophy. | |
| 650 | 0 | |a Digital computer simulation. |0 http://id.loc.gov/authorities/subjects/sh85037973 | |
| 650 | 6 | |a Simulation par ordinateur. | |
| 650 | 6 | |a Informatique |x Philosophie. | |
| 650 | 7 | |a simulation. |2 aat | |
| 650 | 7 | |a COMPUTERS |x Networking |x General. |2 bisacsh | |
| 650 | 7 | |a Digital computer simulation |2 fast | |
| 650 | 7 | |a Computer science |x Philosophy |2 fast | |
| 650 | 7 | |a Computer simulation |2 fast | |
| 700 | 1 | |a Rutten, Jan. | |
| 776 | 0 | 8 | |i Print version: |a Sangiorgi, Davide. |t Advanced Topics in Bisimulation and Coinduction. |d Cambridge : Cambridge University Press, ©2011 |z 9781107004979 |
| 830 | 0 | |a Cambridge tracts in theoretical computer science. |0 http://id.loc.gov/authorities/names/n86714937 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=409003 |3 Volltext |
| 880 | 8 | |6 505-00/(S |a 3.3.3 EXPTIME-completeness of equivalence checking on networks of finite processes -- 3.4 Decidability results for bisimilarity overinfinite-state systems -- 3.4.1 Process rewrite systems -- 3.4.2 Deciding bisimilarity on BPP using a tableau technique -- 3.4.3 Undecidability of bisimilarity on Petri nets -- 3.4.4 Overview of results -- 3.5 The use of bisimilarity checking in verification and tools -- 3.5.1 Some uses of bisimilarity checking -- 3.5.2 Concluding remarks -- Bibliography -- 4 Bisimulation and logic -- 4.1 Introduction -- 4.2 Modal logic and bisimilarity -- 4.3 Bisimulation invariance -- 4.4 Modal mu-calculus -- 4.5 Monadic second-order logic and bisimulation invariance -- Bibliography -- 5 Howe's method for higher-order languages -- 5.1 Introduction -- 5.2 Call-by-value λ-calculus -- 5.3 Applicative (bi)similarity for call-by-value λ-calculus -- 5.4 Congruence -- 5.5 Howe's construction -- 5.6 Contextual equivalence -- 5.7 The transitive closure trick -- 5.8 CIU-equivalence -- 5.9 Call-by-name equivalences -- 5.10 Summary -- 5.11 Assessment -- Bibliography -- 6 Enhancements of the bisimulation proof method -- 6.1 The need for enhancements -- 6.1.1 The bisimulation game -- 6.1.2 Tracking redundancies -- 6.2 Examples of enhancements -- 6.2.1 Diagram-based enhancements -- 6.2.2 Context-based enhancements -- 6.2.3 Combining enhancements -- 6.2.4 Other examples of applications -- 6.2.4.1 Unique solutions of equations -- 6.2.4.2 Replication laws -- 6.2.5 What is a redundant pair-- 6.3 A theory of enhancements -- 6.3.1 Bisimulations and bisimilarity as coinductive objects -- 6.3.2 Enhancements as functions -- 6.3.3 Compositionality problems -- 6.3.4 Symmetry arguments -- 6.3.4.1 Symmetric functions -- 6.3.4.2 Symmetric up-to techniques -- 6.3.4.3 Non-symmetric up-to techniques -- 6.4 Congruence and up to context techniques -- 6.4.1 Contexts. | |
| 938 | |a Coutts Information Services |b COUT |n 20191812 |c 60.00 GBP | ||
| 938 | |a EBL - Ebook Library |b EBLB |n EBL807194 | ||
| 938 | |a ebrary |b EBRY |n ebr10514215 | ||
| 938 | |a EBSCOhost |b EBSC |n 409003 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 334245 | ||
| 938 | |a YBP Library Services |b YANK |n 7273230 | ||
| 938 | |a YBP Library Services |b YANK |n 7408077 | ||
| 938 | |a YBP Library Services |b YANK |n 7236171 | ||
| 938 | |a YBP Library Services |b YANK |n 7266408 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn763159247 |
|---|---|
| _version_ | 1816881777723047936 |
| adam_text | |
| any_adam_object | |
| author | Sangiorgi, Davide |
| author2 | Rutten, Jan |
| author2_role | |
| author2_variant | j r jr |
| author_facet | Sangiorgi, Davide Rutten, Jan |
| author_role | |
| author_sort | Sangiorgi, Davide |
| author_variant | d s ds |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A96 |
| callnumber-search | QA76.9.A96 |
| callnumber-sort | QA 276.9 A96 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Cover; Cambridge Tracts in Theoretical Computer Science 52; Title; Copyright; Contents; Contributors; Preface; 1 Origins of bisimulation and coinduction; 1.1 Introduction; 1.2 Bisimulation in modal logic; 1.2.1 Modal logics; 1.2.2 From homomorphism to p-morphism; 1.2.3 Johan van Benthem; 1.2.4 Discussion; 1.3 Bisimulation in computer science; 1.3.1 Algebraic theory of automata; 1.3.2 Robin Milner; 1.3.3 David Park; 1.3.4 Discussion; 1.4 Set theory; 1.4.1 Non-well-founded sets; 1.4.2 The stratified approach to set theory; 1.4.3 Non-well-founded sets and extensionality. 1.4.4 Marco Forti and Furio Honsell1.4.5 Peter Aczel; 1.4.6 Jon Barwise; 1.4.7 Extensionality quotients: Roland Hinnion and others; 1.4.8 Discussion; 1.5 The introduction of fixed points in computer science; 1.6 Fixed-point theorems; Bibliography; 2 An introduction to (co)algebra and (co)induction; 2.1 Introduction; 2.2 Algebraic and coalgebraic phenomena; 2.3 Inductive and coinductive definitions; 2.4 Functoriality of products, coproducts and powersets; 2.5 Algebras and induction; 2.6 Coalgebras and coinduction; 2.7 Proofs by coinduction and bisimulation; 2.8 Processes coalgebraically. 2.9 Trace semantics, coalgebraically2.10 Exercises; Bibliography; 3 The algorithmics of bisimilarity; 3.1 Introduction; 3.2 Classical algorithms for bisimilarity; 3.2.1 Preliminaries; 3.2.2 The algorithm of Kanellakis and Smolka; 3.2.3 The algorithm of Paige and Tarjan; 3.2.4 Computing bisimilarity, symbolically; 3.2.5 Checking weak equivalences; 3.3 The complexity of checking bisimilarityover finite processes; 3.3.1 Game characterisation of bisimulation-like relations; 3.3.2 Deciding bisimilarity over finite labelledtransition systems is P-complete. 3.3.3 EXPTIME-completeness of equivalence checking on networks of finite processes3.4 Decidability results for bisimilarity overinfinite-state systems; 3.4.1 Process rewrite systems; 3.4.2 Deciding bisimilarity on BPP using a tableau technique; 3.4.3 Undecidability of bisimilarity on Petri nets; 3.4.4 Overview of results; 3.5 The use of bisimilarity checking in verification and tools; 3.5.1 Some uses of bisimilarity checking; 3.5.2 Concluding remarks; Bibliography; 4 Bisimulation and logic; 4.1 Introduction; 4.2 Modal logic and bisimilarity; 4.3 Bisimulation invariance; 4.4 Modal mu-calculus. 4.5 Monadic second-order logic and bisimulation invarianceBibliography; 5 Howe's method for higher-order languages; 5.1 Introduction; 5.2 Call-by-value?-calculus; 5.3 Applicative (bi)similarity for call-by-value?-calculus; 5.4 Congruence; 5.5 Howe's construction; 5.6 Contextual equivalence; 5.7 The transitive closure trick; 5.8 CIU-equivalence; 5.9 Call-by-name equivalences; 5.10 Summary; 5.11 Assessment; Bibliography; 6 Enhancements of the bisimulation proof method; 6.1 The need for enhancements; 6.1.1 The bisimulation game; 6.1.2 Tracking redundancies; 6.2 Examples of enhancements. |
| ctrlnum | (OCoLC)763159247 |
| dewey-full | 004.151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.151 |
| dewey-search | 004.151 |
| dewey-sort | 14.151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>08559cam a2200913Mu 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn763159247</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |n|---|||||</controlfield><controlfield tag="008">111128s2011 enk ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">EBLCP</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">EBLCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IDEBK</subfield><subfield code="d">CDX</subfield><subfield code="d">COO</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AUD</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCF</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UPM</subfield><subfield code="d">OSU</subfield><subfield code="d">N$T</subfield><subfield code="d">E7B</subfield><subfield code="d">UIU</subfield><subfield code="d">CAMBR</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">S3O</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">LIP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UUM</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OL$</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="066" ind1=" " ind2=" "><subfield code="c">(S</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">766418136</subfield><subfield code="a">773039053</subfield><subfield code="a">793601239</subfield><subfield code="a">990542880</subfield><subfield code="a">1014252299</subfield><subfield code="a">1167582958</subfield><subfield code="a">1264977236</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139159340</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139159348</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107004979</subfield><subfield code="q">(Cloth)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107004977</subfield><subfield code="q">(Cloth)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511792588</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511792581</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139161398</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139161393</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="024" ind1="8" ind2=" "><subfield code="a">9786613342454</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)763159247</subfield><subfield code="z">(OCoLC)766418136</subfield><subfield code="z">(OCoLC)773039053</subfield><subfield code="z">(OCoLC)793601239</subfield><subfield code="z">(OCoLC)990542880</subfield><subfield code="z">(OCoLC)1014252299</subfield><subfield code="z">(OCoLC)1167582958</subfield><subfield code="z">(OCoLC)1264977236</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">334245</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.A96</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">013000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">014000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">067000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">032000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">052000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">004.151</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">COM043000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sangiorgi, Davide.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Advanced Topics in Bisimulation and Coinduction.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2011.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (342 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge Tracts in Theoretical Computer Science ;</subfield><subfield code="v">v. 52</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Cover; Cambridge Tracts in Theoretical Computer Science 52; Title; Copyright; Contents; Contributors; Preface; 1 Origins of bisimulation and coinduction; 1.1 Introduction; 1.2 Bisimulation in modal logic; 1.2.1 Modal logics; 1.2.2 From homomorphism to p-morphism; 1.2.3 Johan van Benthem; 1.2.4 Discussion; 1.3 Bisimulation in computer science; 1.3.1 Algebraic theory of automata; 1.3.2 Robin Milner; 1.3.3 David Park; 1.3.4 Discussion; 1.4 Set theory; 1.4.1 Non-well-founded sets; 1.4.2 The stratified approach to set theory; 1.4.3 Non-well-founded sets and extensionality.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1.4.4 Marco Forti and Furio Honsell1.4.5 Peter Aczel; 1.4.6 Jon Barwise; 1.4.7 Extensionality quotients: Roland Hinnion and others; 1.4.8 Discussion; 1.5 The introduction of fixed points in computer science; 1.6 Fixed-point theorems; Bibliography; 2 An introduction to (co)algebra and (co)induction; 2.1 Introduction; 2.2 Algebraic and coalgebraic phenomena; 2.3 Inductive and coinductive definitions; 2.4 Functoriality of products, coproducts and powersets; 2.5 Algebras and induction; 2.6 Coalgebras and coinduction; 2.7 Proofs by coinduction and bisimulation; 2.8 Processes coalgebraically.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">2.9 Trace semantics, coalgebraically2.10 Exercises; Bibliography; 3 The algorithmics of bisimilarity; 3.1 Introduction; 3.2 Classical algorithms for bisimilarity; 3.2.1 Preliminaries; 3.2.2 The algorithm of Kanellakis and Smolka; 3.2.3 The algorithm of Paige and Tarjan; 3.2.4 Computing bisimilarity, symbolically; 3.2.5 Checking weak equivalences; 3.3 The complexity of checking bisimilarityover finite processes; 3.3.1 Game characterisation of bisimulation-like relations; 3.3.2 Deciding bisimilarity over finite labelledtransition systems is P-complete.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">3.3.3 EXPTIME-completeness of equivalence checking on networks of finite processes3.4 Decidability results for bisimilarity overinfinite-state systems; 3.4.1 Process rewrite systems; 3.4.2 Deciding bisimilarity on BPP using a tableau technique; 3.4.3 Undecidability of bisimilarity on Petri nets; 3.4.4 Overview of results; 3.5 The use of bisimilarity checking in verification and tools; 3.5.1 Some uses of bisimilarity checking; 3.5.2 Concluding remarks; Bibliography; 4 Bisimulation and logic; 4.1 Introduction; 4.2 Modal logic and bisimilarity; 4.3 Bisimulation invariance; 4.4 Modal mu-calculus.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">4.5 Monadic second-order logic and bisimulation invarianceBibliography; 5 Howe's method for higher-order languages; 5.1 Introduction; 5.2 Call-by-value?-calculus; 5.3 Applicative (bi)similarity for call-by-value?-calculus; 5.4 Congruence; 5.5 Howe's construction; 5.6 Contextual equivalence; 5.7 The transitive closure trick; 5.8 CIU-equivalence; 5.9 Call-by-name equivalences; 5.10 Summary; 5.11 Assessment; Bibliography; 6 Enhancements of the bisimulation proof method; 6.1 The need for enhancements; 6.1.1 The bisimulation game; 6.1.2 Tracking redundancies; 6.2 Examples of enhancements.</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">6.2.1 Diagram-based enhancements.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Seven articles survey the state of the art. Discusses various aspects of the subject, with an emphasis on process theory.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer simulation.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85029533</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer science</subfield><subfield code="x">Philosophy.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Digital computer simulation.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85037973</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Simulation par ordinateur.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Informatique</subfield><subfield code="x">Philosophie.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">simulation.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Networking</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Digital computer simulation</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer science</subfield><subfield code="x">Philosophy</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer simulation</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rutten, Jan.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Sangiorgi, Davide.</subfield><subfield code="t">Advanced Topics in Bisimulation and Coinduction.</subfield><subfield code="d">Cambridge : Cambridge University Press, ©2011</subfield><subfield code="z">9781107004979</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge tracts in theoretical computer science.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n86714937</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=409003</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="880" ind1="8" ind2=" "><subfield code="6">505-00/(S</subfield><subfield code="a">3.3.3 EXPTIME-completeness of equivalence checking on networks of finite processes -- 3.4 Decidability results for bisimilarity overinfinite-state systems -- 3.4.1 Process rewrite systems -- 3.4.2 Deciding bisimilarity on BPP using a tableau technique -- 3.4.3 Undecidability of bisimilarity on Petri nets -- 3.4.4 Overview of results -- 3.5 The use of bisimilarity checking in verification and tools -- 3.5.1 Some uses of bisimilarity checking -- 3.5.2 Concluding remarks -- Bibliography -- 4 Bisimulation and logic -- 4.1 Introduction -- 4.2 Modal logic and bisimilarity -- 4.3 Bisimulation invariance -- 4.4 Modal mu-calculus -- 4.5 Monadic second-order logic and bisimulation invariance -- Bibliography -- 5 Howe's method for higher-order languages -- 5.1 Introduction -- 5.2 Call-by-value λ-calculus -- 5.3 Applicative (bi)similarity for call-by-value λ-calculus -- 5.4 Congruence -- 5.5 Howe's construction -- 5.6 Contextual equivalence -- 5.7 The transitive closure trick -- 5.8 CIU-equivalence -- 5.9 Call-by-name equivalences -- 5.10 Summary -- 5.11 Assessment -- Bibliography -- 6 Enhancements of the bisimulation proof method -- 6.1 The need for enhancements -- 6.1.1 The bisimulation game -- 6.1.2 Tracking redundancies -- 6.2 Examples of enhancements -- 6.2.1 Diagram-based enhancements -- 6.2.2 Context-based enhancements -- 6.2.3 Combining enhancements -- 6.2.4 Other examples of applications -- 6.2.4.1 Unique solutions of equations -- 6.2.4.2 Replication laws -- 6.2.5 What is a redundant pair-- 6.3 A theory of enhancements -- 6.3.1 Bisimulations and bisimilarity as coinductive objects -- 6.3.2 Enhancements as functions -- 6.3.3 Compositionality problems -- 6.3.4 Symmetry arguments -- 6.3.4.1 Symmetric functions -- 6.3.4.2 Symmetric up-to techniques -- 6.3.4.3 Non-symmetric up-to techniques -- 6.4 Congruence and up to context techniques -- 6.4.1 Contexts.</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">20191812</subfield><subfield code="c">60.00 GBP</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBL - Ebook Library</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL807194</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10514215</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">409003</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">334245</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7273230</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7408077</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7236171</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7266408</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn763159247 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:18:07Z |
| institution | BVB |
| isbn | 9781139159340 1139159348 9781107004979 1107004977 9780511792588 0511792581 9781139161398 1139161393 |
| language | English |
| oclc_num | 763159247 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (342 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | Cambridge tracts in theoretical computer science. |
| series2 | Cambridge Tracts in Theoretical Computer Science ; |
| spelling | Sangiorgi, Davide. Advanced Topics in Bisimulation and Coinduction. Cambridge : Cambridge University Press, 2011. 1 online resource (342 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Cambridge Tracts in Theoretical Computer Science ; v. 52 Cover; Cambridge Tracts in Theoretical Computer Science 52; Title; Copyright; Contents; Contributors; Preface; 1 Origins of bisimulation and coinduction; 1.1 Introduction; 1.2 Bisimulation in modal logic; 1.2.1 Modal logics; 1.2.2 From homomorphism to p-morphism; 1.2.3 Johan van Benthem; 1.2.4 Discussion; 1.3 Bisimulation in computer science; 1.3.1 Algebraic theory of automata; 1.3.2 Robin Milner; 1.3.3 David Park; 1.3.4 Discussion; 1.4 Set theory; 1.4.1 Non-well-founded sets; 1.4.2 The stratified approach to set theory; 1.4.3 Non-well-founded sets and extensionality. 1.4.4 Marco Forti and Furio Honsell1.4.5 Peter Aczel; 1.4.6 Jon Barwise; 1.4.7 Extensionality quotients: Roland Hinnion and others; 1.4.8 Discussion; 1.5 The introduction of fixed points in computer science; 1.6 Fixed-point theorems; Bibliography; 2 An introduction to (co)algebra and (co)induction; 2.1 Introduction; 2.2 Algebraic and coalgebraic phenomena; 2.3 Inductive and coinductive definitions; 2.4 Functoriality of products, coproducts and powersets; 2.5 Algebras and induction; 2.6 Coalgebras and coinduction; 2.7 Proofs by coinduction and bisimulation; 2.8 Processes coalgebraically. 2.9 Trace semantics, coalgebraically2.10 Exercises; Bibliography; 3 The algorithmics of bisimilarity; 3.1 Introduction; 3.2 Classical algorithms for bisimilarity; 3.2.1 Preliminaries; 3.2.2 The algorithm of Kanellakis and Smolka; 3.2.3 The algorithm of Paige and Tarjan; 3.2.4 Computing bisimilarity, symbolically; 3.2.5 Checking weak equivalences; 3.3 The complexity of checking bisimilarityover finite processes; 3.3.1 Game characterisation of bisimulation-like relations; 3.3.2 Deciding bisimilarity over finite labelledtransition systems is P-complete. 3.3.3 EXPTIME-completeness of equivalence checking on networks of finite processes3.4 Decidability results for bisimilarity overinfinite-state systems; 3.4.1 Process rewrite systems; 3.4.2 Deciding bisimilarity on BPP using a tableau technique; 3.4.3 Undecidability of bisimilarity on Petri nets; 3.4.4 Overview of results; 3.5 The use of bisimilarity checking in verification and tools; 3.5.1 Some uses of bisimilarity checking; 3.5.2 Concluding remarks; Bibliography; 4 Bisimulation and logic; 4.1 Introduction; 4.2 Modal logic and bisimilarity; 4.3 Bisimulation invariance; 4.4 Modal mu-calculus. 4.5 Monadic second-order logic and bisimulation invarianceBibliography; 5 Howe's method for higher-order languages; 5.1 Introduction; 5.2 Call-by-value?-calculus; 5.3 Applicative (bi)similarity for call-by-value?-calculus; 5.4 Congruence; 5.5 Howe's construction; 5.6 Contextual equivalence; 5.7 The transitive closure trick; 5.8 CIU-equivalence; 5.9 Call-by-name equivalences; 5.10 Summary; 5.11 Assessment; Bibliography; 6 Enhancements of the bisimulation proof method; 6.1 The need for enhancements; 6.1.1 The bisimulation game; 6.1.2 Tracking redundancies; 6.2 Examples of enhancements. 6.2.1 Diagram-based enhancements. Seven articles survey the state of the art. Discusses various aspects of the subject, with an emphasis on process theory. Includes bibliographical references and index. Print version record. English. Computer simulation. http://id.loc.gov/authorities/subjects/sh85029533 Computer science Philosophy. Digital computer simulation. http://id.loc.gov/authorities/subjects/sh85037973 Simulation par ordinateur. Informatique Philosophie. simulation. aat COMPUTERS Networking General. bisacsh Digital computer simulation fast Computer science Philosophy fast Computer simulation fast Rutten, Jan. Print version: Sangiorgi, Davide. Advanced Topics in Bisimulation and Coinduction. Cambridge : Cambridge University Press, ©2011 9781107004979 Cambridge tracts in theoretical computer science. http://id.loc.gov/authorities/names/n86714937 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=409003 Volltext 505-00/(S 3.3.3 EXPTIME-completeness of equivalence checking on networks of finite processes -- 3.4 Decidability results for bisimilarity overinfinite-state systems -- 3.4.1 Process rewrite systems -- 3.4.2 Deciding bisimilarity on BPP using a tableau technique -- 3.4.3 Undecidability of bisimilarity on Petri nets -- 3.4.4 Overview of results -- 3.5 The use of bisimilarity checking in verification and tools -- 3.5.1 Some uses of bisimilarity checking -- 3.5.2 Concluding remarks -- Bibliography -- 4 Bisimulation and logic -- 4.1 Introduction -- 4.2 Modal logic and bisimilarity -- 4.3 Bisimulation invariance -- 4.4 Modal mu-calculus -- 4.5 Monadic second-order logic and bisimulation invariance -- Bibliography -- 5 Howe's method for higher-order languages -- 5.1 Introduction -- 5.2 Call-by-value λ-calculus -- 5.3 Applicative (bi)similarity for call-by-value λ-calculus -- 5.4 Congruence -- 5.5 Howe's construction -- 5.6 Contextual equivalence -- 5.7 The transitive closure trick -- 5.8 CIU-equivalence -- 5.9 Call-by-name equivalences -- 5.10 Summary -- 5.11 Assessment -- Bibliography -- 6 Enhancements of the bisimulation proof method -- 6.1 The need for enhancements -- 6.1.1 The bisimulation game -- 6.1.2 Tracking redundancies -- 6.2 Examples of enhancements -- 6.2.1 Diagram-based enhancements -- 6.2.2 Context-based enhancements -- 6.2.3 Combining enhancements -- 6.2.4 Other examples of applications -- 6.2.4.1 Unique solutions of equations -- 6.2.4.2 Replication laws -- 6.2.5 What is a redundant pair-- 6.3 A theory of enhancements -- 6.3.1 Bisimulations and bisimilarity as coinductive objects -- 6.3.2 Enhancements as functions -- 6.3.3 Compositionality problems -- 6.3.4 Symmetry arguments -- 6.3.4.1 Symmetric functions -- 6.3.4.2 Symmetric up-to techniques -- 6.3.4.3 Non-symmetric up-to techniques -- 6.4 Congruence and up to context techniques -- 6.4.1 Contexts. |
| spellingShingle | Sangiorgi, Davide Advanced Topics in Bisimulation and Coinduction. Cambridge tracts in theoretical computer science. Cover; Cambridge Tracts in Theoretical Computer Science 52; Title; Copyright; Contents; Contributors; Preface; 1 Origins of bisimulation and coinduction; 1.1 Introduction; 1.2 Bisimulation in modal logic; 1.2.1 Modal logics; 1.2.2 From homomorphism to p-morphism; 1.2.3 Johan van Benthem; 1.2.4 Discussion; 1.3 Bisimulation in computer science; 1.3.1 Algebraic theory of automata; 1.3.2 Robin Milner; 1.3.3 David Park; 1.3.4 Discussion; 1.4 Set theory; 1.4.1 Non-well-founded sets; 1.4.2 The stratified approach to set theory; 1.4.3 Non-well-founded sets and extensionality. 1.4.4 Marco Forti and Furio Honsell1.4.5 Peter Aczel; 1.4.6 Jon Barwise; 1.4.7 Extensionality quotients: Roland Hinnion and others; 1.4.8 Discussion; 1.5 The introduction of fixed points in computer science; 1.6 Fixed-point theorems; Bibliography; 2 An introduction to (co)algebra and (co)induction; 2.1 Introduction; 2.2 Algebraic and coalgebraic phenomena; 2.3 Inductive and coinductive definitions; 2.4 Functoriality of products, coproducts and powersets; 2.5 Algebras and induction; 2.6 Coalgebras and coinduction; 2.7 Proofs by coinduction and bisimulation; 2.8 Processes coalgebraically. 2.9 Trace semantics, coalgebraically2.10 Exercises; Bibliography; 3 The algorithmics of bisimilarity; 3.1 Introduction; 3.2 Classical algorithms for bisimilarity; 3.2.1 Preliminaries; 3.2.2 The algorithm of Kanellakis and Smolka; 3.2.3 The algorithm of Paige and Tarjan; 3.2.4 Computing bisimilarity, symbolically; 3.2.5 Checking weak equivalences; 3.3 The complexity of checking bisimilarityover finite processes; 3.3.1 Game characterisation of bisimulation-like relations; 3.3.2 Deciding bisimilarity over finite labelledtransition systems is P-complete. 3.3.3 EXPTIME-completeness of equivalence checking on networks of finite processes3.4 Decidability results for bisimilarity overinfinite-state systems; 3.4.1 Process rewrite systems; 3.4.2 Deciding bisimilarity on BPP using a tableau technique; 3.4.3 Undecidability of bisimilarity on Petri nets; 3.4.4 Overview of results; 3.5 The use of bisimilarity checking in verification and tools; 3.5.1 Some uses of bisimilarity checking; 3.5.2 Concluding remarks; Bibliography; 4 Bisimulation and logic; 4.1 Introduction; 4.2 Modal logic and bisimilarity; 4.3 Bisimulation invariance; 4.4 Modal mu-calculus. 4.5 Monadic second-order logic and bisimulation invarianceBibliography; 5 Howe's method for higher-order languages; 5.1 Introduction; 5.2 Call-by-value?-calculus; 5.3 Applicative (bi)similarity for call-by-value?-calculus; 5.4 Congruence; 5.5 Howe's construction; 5.6 Contextual equivalence; 5.7 The transitive closure trick; 5.8 CIU-equivalence; 5.9 Call-by-name equivalences; 5.10 Summary; 5.11 Assessment; Bibliography; 6 Enhancements of the bisimulation proof method; 6.1 The need for enhancements; 6.1.1 The bisimulation game; 6.1.2 Tracking redundancies; 6.2 Examples of enhancements. Computer simulation. http://id.loc.gov/authorities/subjects/sh85029533 Computer science Philosophy. Digital computer simulation. http://id.loc.gov/authorities/subjects/sh85037973 Simulation par ordinateur. Informatique Philosophie. simulation. aat COMPUTERS Networking General. bisacsh Digital computer simulation fast Computer science Philosophy fast Computer simulation fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85029533 http://id.loc.gov/authorities/subjects/sh85037973 |
| title | Advanced Topics in Bisimulation and 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. |
| title_fullStr | Advanced Topics in Bisimulation and Coinduction. |
| title_full_unstemmed | Advanced Topics in Bisimulation and Coinduction. |
| title_short | Advanced Topics in Bisimulation and Coinduction. |
| title_sort | advanced topics in bisimulation and coinduction |
| topic | Computer simulation. http://id.loc.gov/authorities/subjects/sh85029533 Computer science Philosophy. Digital computer simulation. http://id.loc.gov/authorities/subjects/sh85037973 Simulation par ordinateur. Informatique Philosophie. simulation. aat COMPUTERS Networking General. bisacsh Digital computer simulation fast Computer science Philosophy fast Computer simulation fast |
| topic_facet | Computer simulation. Computer science Philosophy. Digital computer simulation. Simulation par ordinateur. Informatique Philosophie. simulation. COMPUTERS Networking General. Digital computer simulation Computer science Philosophy Computer simulation |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=409003 |
| work_keys_str_mv | AT sangiorgidavide advancedtopicsinbisimulationandcoinduction AT ruttenjan advancedtopicsinbisimulationandcoinduction |