| Record ID | marc_loc_updates/v40.i13.records.utf8:10068875:3202 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_updates/v40.i13.records.utf8:10068875:3202?format=raw |
LEADER: 03202cam a2200361 a 4500
001 2011027492
003 DLC
005 20120322165342.0
008 110629s2012 enka b 001 0 eng
010 $a 2011027492
020 $a9781107003637
040 $aDLC$cDLC$dDLC
042 $apcc
050 00 $aQA76.9.A96$bS366 2012
082 00 $a004.01/5113$223
084 $aCOM043000$2bisacsh
100 1 $aSangiorgi, Davide.
245 13 $aAn introduction to bisimulation and coinduction /$cDavide Sangiorgi.
260 $aCambridge ;$aNew York :$bCambridge University Press,$cc2012.
300 $axii, 247 p. :$bill. ;$c25 cm.
520 $a"Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics. The best known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, non-well-founded sets, etc. This book presents bisimulation and coinduction: the fundamental concepts and techniques and the duality with induction. Each chapter contains exercises and selected solutions, enabling students to connect theory with practice. A special emphasis is placed on bisimulation as a behavioural equivalence for processes. Thus the book serves as an introduction to models for expressing processes (such as process calculi) and to the associated techniques of operational and algebraic analysis"--$cProvided by publisher.
520 $a"Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction, and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics. The best known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, nonwell- founded sets, etc"--$cProvided by publisher.
504 $aIncludes bibliographical references (p 235-243) and index.
505 8 $aTowards bisimulation -- Coinduction and the duality with induction -- Algebraic properties of bisimilarity -- Processes with internal activities -- Other approaches to behavioural equivalences -- Refinements of simulation -- Basic observables.
650 0 $aBisimulation.
650 0 $aCoinduction (Mathematics)
650 0 $aModality (Logic)
650 0 $aInduction (Mathematics)
650 0 $aComputer science.
650 7 $aCOMPUTERS / Networking / General.$2bisacsh
856 42 $3Contributor biographical information$uhttp://www.loc.gov/catdir/enhancements/fy1113/2011027492-b.html
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/enhancements/fy1113/2011027492-d.html
856 41 $3Table of contents only$uhttp://www.loc.gov/catdir/enhancements/fy1113/2011027492-t.html