Cargando…
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.
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge :
Cambridge University Press,
2011.
|
| Colección: | Cambridge tracts in theoretical computer science.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Mu 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocn763159247 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.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 | ||
| 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 | |
| 029 | 1 | |a AU@ |b 000048846756 | |
| 029 | 1 | |a CHNEW |b 000616317 | |
| 029 | 1 | |a DEBSZ |b 397170025 | |
| 029 | 1 | |a NZ1 |b 14693844 | |
| 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 | 0 | 4 | |a 004.151 |
| 084 | |a COM043000 |2 bisacsh | ||
| 049 | |a UAMI | ||
| 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. | ||
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Computer simulation. | |
| 650 | 0 | |a Computer science |x Philosophy. | |
| 650 | 0 | |a Digital computer simulation. | |
| 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. | |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=409003 |z Texto completo |
| 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 IZTAP | ||