Partial order and lattice theory play an important role in many
disciplines of computer science and engineering. For example, they have
applications in distributed computing (vector clocks, global predicate
detection), concurrency theory (pomsets, occurrence nets), programming
language semantics (fixed-point semantics), and data mining (concept
analysis). They are also useful in other disciplines of mathematics such as
combinatorics, number theory and group theory.
This book differs from earlier books written
on the subject in two aspects. First,
the present book takes a computational
perspective --- the emphasis is on algorithms
and their complexity.
Second, existing books do not dwell on applications
of lattice theory. This book treats applications at par
with the theory. In particular, I have given applications of lattice
theory to distributed computing and combinatorics.
John Wiley & Sons
For link to Amazon click here
For link to Barnes & Noble click here