Advanced topics in bisimulation and coinduction / (Record no. 53043)

000 -LEADER
fixed length control field 02376cam a22003014a 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 110629s2012 enka b 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9781107004979
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
080 ## - UNIVERSAL DECIMAL CLASSIFICATION NUMBER
Universal Decimal Classification number 510.6
Item number SAN
100 ## - MAIN ENTRY--AUTHOR NAME
Personal name Sangiorgi, Davide
245 00 - TITLE STATEMENT
Title Advanced topics in bisimulation and coinduction /
Statement of responsibility, etc Jan Rutten.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Cambridge ;
-- New York :
Name of publisher Cambridge University Press,
Year of publication 2012.
300 ## - PHYSICAL DESCRIPTION
Number of Pages xiii, 326 p. :
Other physical details ill. ;
490 0# - SERIES STATEMENT
Series statement Cambridge tracts in theoretical computer science ;
Volume number/sequential designation 52
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and index.
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note Machine generated contents note: Preface; List of contributors; 1. Origins of bisimulation and coinduction Davide Sangiorgi; 2. An introduction to (co)algebra and (co)induction Bart Jacobs and Jan Rutten; 3. The algorithmics of bisimilarity Luca Aceto, Anna Ingolfsdottir and Jiři; Srba; 4. Bisimulation and logic Colin Stirling; 5. Howe's method for higher-order languages Andrew Pitts; 6. Enhancements of the bisimulation proof method Damien Pous and Davide Sangiorgi; 7. Probabilistic bisimulation Prakash Panangaden.
520 ## - SUMMARY, ETC.
Summary, etc "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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Bisimulation.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Coinduction (Mathematics)
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Modality (Logic)
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Induction (Mathematics)
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term COMPUTERS / Networking / General.
690 ## - LOCAL SUBJECT ADDED ENTRY--TOPICAL TERM (OCLC, RLIN)
Topical term or geographic name as entry element Mathematics
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Sangiorgi, Davide.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Rutten, J. J. M. M.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type BOOKS
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Full call number Accession Number Koha item type Owner (If the Item is Gratis)
        IMSc Library IMSc Library First Floor, Rack No: 28, Shelf No: 8 510.6 SAN 75277 BOOKS Publisher
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha