000 02929nam a22004218i 4500
001 CR9780511792588
003 UkCbUP
005 20200124160230.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 100624s2012||||enk o ||1 0|eng|d
020 _a9780511792588 (ebook)
020 _z9781107004979 (hardback)
040 _aUkCbUP
_beng
_erda
_cUkCbUP
050 0 0 _aQA76.9.A96
_bS365 2012
082 0 0 _a004.01/5113
_223
245 0 0 _aAdvanced topics in bisimulation and coinduction /
_cedited by Davide Sangiorgi, Jan Rutten.
246 3 _aAdvanced Topics in Bisimulation & Coinduction
264 1 _aCambridge :
_bCambridge University Press,
_c2012.
300 _a1 online resource (xiii, 326 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aCambridge tracts in theoretical computer science ;
_v52
500 _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505 0 0 _g1.
_tOrigins of bisimulation and coinduction /
_rDavide Sangiorgi --
_g2.
_tAn introduction to (co)algebra and (co)induction /
_rBart Jacobs and Jan Rutten --
_g3.
_tThe algorithmics of bisimilarity /
_rLuca Aceto, Anna Ingolfsdottir and Jiři; Srba --
_g4.
_tBisimulation and logic /
_rColin Stirling --
_g5.
_tHowe's method for higher-order languages /
_rAndrew Pitts --
_g6.
_tEnhancements of the bisimulation proof method /
_rDamien Pous and Davide Sangiorgi --
_g7.
_gProbabilistic bisimulation /
_rPrakash Panangaden.
520 _aCoinduction 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 _aBisimulation.
650 0 _aCoinduction (Mathematics)
650 0 _aModality (Logic)
650 0 _aInduction (Mathematics)
650 0 _aComputer science.
700 1 _aSangiorgi, Davide,
_eeditor.
700 1 _aRutten, J. J. M. M.,
_eeditor.
776 0 8 _iPrint version:
_z9781107004979
830 0 _aCambridge tracts in theoretical computer science ;
_v52.
856 4 0 _uhttps://doi.org/10.1017/CBO9780511792588
999 _c517547
_d517545