This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics. Seven chapters deal with various aspects of bisimulation and coinduction: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities.
"Sinopsis" puede pertenecer a otra edición de este libro.
Davide Sangiorgi is Full Professor in Computer Science at the University of Bologna, Italy.
Jan Rutten is a senior researcher at Centrum Wiskunde and Informatica (CWI) in Amsterdam and Professor of Theoretical Computer Science at Radboud University, Nijmegen.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 12619334-n
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: new. Hardcover. 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. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics. Seven chapters deal with various aspects of bisimulation and coinduction: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781107004979
Cantidad disponible: 1 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9781107004979
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In English. Nº de ref. del artículo: ria9781107004979_new
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 12619334-n
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 1st edition. 340 pages. 9.50x6.50x1.00 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __1107004977
Cantidad disponible: 1 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. Seven articles survey the state of the art. Discusses various aspects of the subject, with an emphasis on process theory. Editor(s): Sangiorgi, Davide; Rutten, Jan. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 340 pages, 20 b/w illus. 110 exercises. BIC Classification: UB; UMX; UYA. Category: (U) Tertiary Education (US: College). Dimension: 237 x 162 x 24. Weight in Grams: 614. . 2011. Hardback. . . . . Nº de ref. del artículo: V9781107004979
Cantidad disponible: Más de 20 disponibles
Librería: CitiRetail, Stevenage, Reino Unido
Hardcover. Condición: new. Hardcover. 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. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics. Seven chapters deal with various aspects of bisimulation and coinduction: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9781107004979
Cantidad disponible: 1 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Über den AutorDavide Sangiorgi is Full Professor in Computer Science at the University of Bologna, Italy. Jan Rutten is a senior researcher at Centrum Wiskunde and Informatica (CWI) in Amsterdam and Professor of Theoretical Compute. Nº de ref. del artículo: 760523539
Cantidad disponible: Más de 20 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 340. Nº de ref. del artículo: 263123381
Cantidad disponible: 4 disponibles