advanced topics bisimulation coinduction (15 risultati)

Hardcover. Condizione: 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.

Condizione: New.

Condizione: New. In English.

Condizione: New.

Condizione: New.

Hardcover. Condizione: 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.

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: Like New. Like New. book.

Hardcover. Condizione: Brand New. 1st edition. 340 pages. 9.50x6.50x1.00 inches. In Stock.

Buch. Condizione: 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.

Hardcover. Condizione: 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.

Hardcover. Condizione: 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.

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: Brand New. 1st edition. 340 pages. 9.50x6.50x1.00 inches. In Stock. This item is printed on demand.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. &Uumlber 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.