View in EDS PDF Full Text

Advanced Topics in Bisimulation and Coinduction

Saved in:
Bibliographic Details
Title: Advanced Topics in Bisimulation and Coinduction
Description: 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.
Authors: Davide Sangiorgi, Jan Rutten
Resource Type: eBook.
Subjects: Computer science--Philosophy, Computer simulation, Digital computer simulation
Categories: COMPUTERS / Information Technology, COMPUTERS / Computer Literacy, COMPUTERS / Computer Science, COMPUTERS / Data Science / General, COMPUTERS / Machine Theory, COMPUTERS / Reference, COMPUTERS / Hardware / General
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 409003
RelevancyScore: 1038
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1037.72192382813
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$409003$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$409003$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Advanced Topics in Bisimulation and Coinduction
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Davide+Sangiorgi%22">Davide Sangiorgi</searchLink><br /><searchLink fieldCode="AR" term="%22Jan+Rutten%22">Jan Rutten</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computer+science--Philosophy%22">Computer science--Philosophy</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+simulation%22">Computer simulation</searchLink><br /><searchLink fieldCode="DE" term="%22Digital+computer+simulation%22">Digital computer simulation</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Information+Technology%22">COMPUTERS / Information Technology</searchLink><br /><searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Computer+Literacy%22">COMPUTERS / Computer Literacy</searchLink><br /><searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Computer+Science%22">COMPUTERS / Computer Science</searchLink><br /><searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Data+Science+%2F+General%22">COMPUTERS / Data Science / General</searchLink><br /><searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Machine+Theory%22">COMPUTERS / Machine Theory</searchLink><br /><searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Reference%22">COMPUTERS / Reference</searchLink><br /><searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Hardware+%2F+General%22">COMPUTERS / Hardware / General</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=409003
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 004.151
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Computer science--Philosophy
        Type: general
      – SubjectFull: Computer simulation
        Type: general
      – SubjectFull: Digital computer simulation
        Type: general
    Titles:
      – TitleFull: Advanced Topics in Bisimulation and Coinduction
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Davide Sangiorgi
      – PersonEntity:
          Name:
            NameFull: Jan Rutten
      – PersonEntity:
          Name:
            NameFull: Davide Sangiorgi
      – PersonEntity:
          Name:
            NameFull: Jan Rutten
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2011
            – D: 04
              M: 02
              Type: profile
              Y: 2014
          Identifiers:
            – Type: isbn-print
              Value: 9781107004979
            – Type: isbn-electronic
              Value: 9781139161398
          Numbering:
            – Type: volume
              Value: 00052
          Titles:
            – TitleFull: Advanced Topics in Bisimulation and Coinduction
              Type: main
ResultId 1