Published by Cambridge University Press, Cambridge, 2012
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
£ 60
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: Very Good. Lightly edge worn. A nice, bright copy. ; Cambridge Tracts In Theoretical Computer Science, Series Number 52; 9.0 X 6.1 X 0.9 inches; 326 pages.
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
£ 93.47
Convert currencyQuantity: 1 available
Add to basketCondition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 122.58
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 122.59
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In English.
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: California Books, Miami, FL, U.S.A.
£ 124.58
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: CitiRetail, Stevenage, United Kingdom
Hardcover. Condition: 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: GreatBookPrices, Columbia, MD, U.S.A.
£ 122.59
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 153.99
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. Like New. book.
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.
£ 132.63
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Hardcover. Condition: Brand New. 1st edition. 340 pages. 9.50x6.50x1.00 inches. In Stock.
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: AussieBookSeller, Truganina, VIC, Australia
£ 157.65
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: GreatBookPrices, Columbia, MD, U.S.A.
£ 178.21
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
£ 183.81
Convert currencyQuantity: 1 available
Add to basketBuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Seven articles survey the state of the art. Discusses various aspects of the subject, with an emphasis on process theory.
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 1st edition. 340 pages. 9.50x6.50x1.00 inches. In Stock. This item is printed on demand.
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Language: English
Seller: moluna, Greven, Germany
£ 136.11
Convert currencyQuantity: Over 20 available
Add to basketCondition: 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.