版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
丛 书 名:Cambridge Tracts in Theoretical Computer Science
版本说明:0
I S B N:(纸本) 9781107004979
出 版 社:Cambridge University Press
出 版 年:2011年
主 题 词:Modality (Logic) Coinduction (Mathematics) Bisimulation Computer science Induction (Mathematics)
学科分类:050302[文学-传播学] 12[管理学] 05[文学] 07[理学] 08[工学] 070101[理学-基础数学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 081203[工学-计算机应用技术] 0835[工学-软件工程] 0503[文学-新闻传播学] 0701[理学-数学] 081201[工学-计算机系统结构] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术(可授工学、理学学位)]
摘 要: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.