£67.95

Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems (CRM Monograph Series)

Higher Education

Price data last checked 93 day(s) ago - refreshing...

View at Amazon

We'll watch every seller, every day. One email when your price arrives.

This is the most expensive it has ever been. Walk away.

£68 today · previous high £68 · all-time low £51

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 638 days • 638 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 638 days • 8 price levels

Days at Price

Current Price

Price Analysis

Most common price: £68 (284 days, 44.5%)

Price range: £51 - £68

Price levels: 8 different prices over 638 days

Description

This book consists of two sets of lecture notes devoted to slightly different methods of analysis of concurrent and probabilistic computational systems. The first set of lectures develops a calculus of streams (a generalization of the set of natural numbers) based on the coinduction principle coming from the theory of coalgebras. It is now well understood that the interplay between algebra (for describing structure) and coalgebra (for describing dynamics) is crucial for understanding concurrent systems. There is a striking analogy between streams and formula calculus reminiscent of those appearing in quantum calculus. These lecture notes will appeal to anyone working in concurrency theory but also to algebraists and logicians.The other set of lecture notes focuses on methods for automatically verifying probabilistic systems using techniques of model checking. The unique aspect of these lectures is the coverage of both theory and practice. The authors have been responsible for one of the most successful experimental systems for probabilistic model checking. These lecture notes are of interest to software engineers, real-time programmers, researchers in machine learning and numerical analysts who may well be interested to see how standard numerical techniques are used in a novel context. Both sets of lectures are expository and suitable for graduate courses in theoretical computer science and for research mathematicians interested in design and analysis of concurrent and probabilistic computational systems.

Product Specifications

Format: hardcover
ASIN: 0821835718
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Education > Higher Education
Domain: Amazon UK
Release Date: 08 April 2004
Listed Since: 11 February 2007

Barcode

No barcode data available

Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems (CRM Monograph Series)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Understanding Concurrent Systems (Texts in Computer Science)

Concurrent and Real-time Systems: The CSP Approach (Worldwide Series in Computer Science)

Theories of Programming: The Life and Works of Tony Hoare (ACM Collection II)

Concurrency Verification: Introduction to Compositional and Non-compositional Methods: 54 (Cambridge Tracts in Theoretical Computer Science, Series Number 54)

CONCUR '95 Concurrency Theory: 6th International Conference, Philadelphia, PA, USA, August 21 - 24, 1995. Proceedings: 962 (Lecture Notes in Computer Science, 962)

Communicating Sequential Processes. The First 25 Years: Symposium on the Occasion of 25 Years of CSP, London, UK, July 7-8, 2004. Revised Invited Papers

Concurrency, Specification and Programming: Revised Selected Papers from the 29th International Workshop on Concurrency, Specification and Programming (CS&P'21), Berlin, Germany

Stochastic Coalgebraic Logic (Monographs in Theoretical Computer Science. An EATCS Series)

STACS 93: 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993. Proceedings: 665 (Lecture Notes in Computer Science, 665)

Models for Concurrency (Algebra, Logic and Applications, Vol 11)

CONCUR '98 Concurrency Theory: 9th International Conference, Nice, France, September 8-11, 1998, Proceedings: 1466 (Lecture Notes in Computer Science, 1466)

New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings: 3526 (Lecture Notes in Computer Science, 3526)

Verification of Reactive Systems: Formal Methods and Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

Verification of Sequential and Concurrent Programs (Texts in Computer Science)

Springer - Petri Nets: Theoretical Models and Analysis Methods

Stochastic Relations: Foundations for Markov Transition Systems (Chapman & Hall/CRC Studies in Informatics Series)

Concurrency 88: International Conference on Concurrency Hamburg, FRG, October 18-19, 1988. Proceedings: 335 (Lecture Notes in Computer Science, 335)

Principles of Cyber-Physical Systems

Verification of Reactive Systems: Formal Methods and Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

Directed Algebraic Topology and Concurrency (Springerbriefs in Applied Sciences and Technology / Springer)

Automatic Verification of Sequential Infinite-State Processes: 1354 (Lecture Notes in Computer Science, 1354)

Formal Methods in Computer Science (Textbooks in Mathematics)

Temporal Verification of Reactive Systems: Safety

Handbook of Process Algebra