Models of computation
Author(s)
Bibliographic Information
Models of computation
（Texts in theoretical computer science, An EATCS series）
Springer, c2017
- : pbk
Available at / 3 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 30-31)
Description and Table of Contents
Description
This book presents in their basic form the most important models of computation, their basic programming paradigms, and their mathematical descriptions, both concrete and abstract. Each model is accompanied by relevant formal techniques for reasoning on it and for proving some properties. After preliminary chapters that introduce the notions of structure and meaning, semantic methods, inference rules, and logic programming, the authors arrange their chapters into parts on IMP, a simple imperative language; HOFL, a higher-order functional language; concurrent, nondeterministic and interactive models; and probabilistic/stochastic models.
The authors have class-tested the book content over many years, and it will be valuable for graduate and advanced undergraduate students of theoretical computer science and distributed systems, and for researchers in this domain. Each chapter of the book concludes with a list of exercises addressing the key techniques introduced, solutions to selected exercises are offered at the end of the book.
Table of Contents
Preliminaries.- Operational Semantics of IMP.- Induction and Recursion.- Partial Orders and Fixpoints.- Denotational Semantics of IMP.- Operational Semantics of HOFL.- Domain Theory.- HOFL Denotational Semantics.- Equivalence Between HOFL Denotational and Operational Semantics.- Calculus for Communicating Systems (CCS).- Temporal Logic and mu-Calculus.- Pi-Calculus.- Measure Theory and Markov Chains.- Markov Chains with Actions and Non-determinism.- Performance Evaluation Process Algebra (PEPA).
by "Nielsen BookData"
