Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 146,71
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In English.
Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 208,01
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 207,00
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 1st edition. 340 pages. 9.50x6.50x1.00 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2011
ISBN 10: 1107004977 ISBN 13: 9781107004979
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.