机读格式显示(MARC)
- 000 02014cam a2200337 a 4500
- 008 110629s2012 enka b 001 0 eng
- 040 __ |a DLC |c DLC |d DLC
- 050 00 |a QA76.9.A96 |b S365 2012
- 082 00 |a 004.01/5113 |2 23
- 084 __ |a COM043000 |2 bisacsh
- 245 00 |a Advanced topics in bisimulation and coinduction / |c edited by Davide Sangiorgi, Jan Rutten.
- 260 __ |a Cambridge ; |a New York : |b Cambridge University Press, |c 2012.
- 300 __ |a xiii, 326 p. : |b ill. ; |c 24 cm.
- 490 0_ |a Cambridge tracts in theoretical computer science ; |v 52
- 504 __ |a Includes bibliographical references and index.
- 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 _0 |a Coinduction (Mathematics)
- 650 _0 |a Modality (Logic)
- 650 _0 |a Induction (Mathematics)
- 650 _0 |a Computer science.
- 650 _7 |a COMPUTERS / Networking / General. |2 bisacsh
- 700 1_ |a Sangiorgi, Davide.
- 700 1_ |a Rutten, J. J. M. M.