Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 121.47
Quantity: Over 20 available
Add to basketCondition: New. In English.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 121.46
Quantity: Over 20 available
Add to basketCondition: New.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: 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. . . . .
Language: English
Published by Cambridge University Press CUP, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 340.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: 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. . . . . Books ship from the US and Ireland.
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 1st edition. 340 pages. 9.50x6.50x1.00 inches. In Stock.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. 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.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 233.99
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
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.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: moluna, Greven, Germany
Condition: 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.
Language: English
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 340 20 Illus.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 340.
Language: English
Published by Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: preigu, Osnabrück, Germany
Buch. Condition: Neu. Advanced Topics in Bisimulation and Coinduction | Davide Sangiorgi (u. a.) | Buch | Gebunden | Englisch | 2011 | Cambridge University Press | EAN 9781107004979 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
Language: English
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Seller: AussieBookSeller, Truganina, VIC, Australia
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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.