Automated and semi-automated manipulation of so-called labelled transition systems has become an important means in discovering flaws in software and hardware systems. Process algebra has been developed to express such labelled transition systems algebraically, which enhances the ways of manipulation by means of equational logic and term rewriting. The theory of process algebra has developed rapidly over the last twenty years, and verification tools have been developed on the basis of process algebra, often in cooperation with techniques related to model checking. This textbook gives a thorough introduction into the basics of process algebra and its applications.
Introduction to Process Algebra
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
15 of 16 people found the following review helpful:
5.0 out of 5 stars
Wondefully well written,
By Herman Meijer (Germany) - See all my reviews
This review is from: Introduction to Process Algebra (Texts in Theoretical Computer Science. An EATCS Series) (Hardcover)
This is a delightful new presentation of Process Algebra, which was much needed since the classic text by Baeten and Weijland is getting outdated. In comparison, I find Fokkink's text more easy to digest, more precise and going significantly further. Indeed, it should be for a theory that has evolved rapidly in the last decade. Process Algebra is on its way to become the tool to build full-proof software that will lead us out of the present day software jungle. I have used this text in my one semester class in Trier and can recommend it to any serious student of computer science.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
System behaviour generally consists of processes and data. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
rooted branching bisimulation equivalence, basic process terms, linear recursive specification, modulo bisimulation equivalence, desired external behaviour, bisimilar process terms, structural induction with respect, regular process graph, required external behaviour, rooted branching bisimilar, panth format, cool format, branching bisimulation relation, guarded recursive specifications, guarded recursion, second transition rule, recursion variables, closed instantiations, approximation induction principle, axioms range, linear recursive equations, linear recursion, branching bisimilarity, two process terms, encapsulation operators New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
System behaviour generally consists of processes and data. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
rooted branching bisimulation equivalence, basic process terms, linear recursive specification, modulo bisimulation equivalence, desired external behaviour, bisimilar process terms, structural induction with respect, regular process graph, required external behaviour, rooted branching bisimilar, panth format, cool format, branching bisimulation relation, guarded recursive specifications, guarded recursion, second transition rule, recursion variables, closed instantiations, approximation induction principle, axioms range, linear recursive equations, linear recursion, branching bisimilarity, two process terms, encapsulation operators New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 30
books:
See all 30 books this book cites
35
books
cite this book:
See all 35 books citing this book
- Handbook of Process Algebra by J.A. Bergstra in Back Matter (1), and Back Matter (2)
- Communicating Sequential Processes (Prentice Hall International Series in Computing Science) by C.A.R. Hoare on page 2, and Back Matter
- Programming Concepts, Methods and Calculi by Ifip Tc2 in Back Matter
- Algebraic Specification of Communication Protocols (Cambridge Tracts in Theoretical Computer Science) by S. Mauw in Back Matter
- Temporal Logic of Programs (E a T C S Monographs on Theoretical Computer Science) by Fred Kroger in Back Matter
See all 30 books this book cites
- Process Algebra with Timing by J.C.M. Baeten in Back Matter (1), and Back Matter (2)
- Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday (Lecture Notes in ... Computer Science and General Issues) by Aart Middeldorp on page 365, and page 494
- Complexity Theory and Cryptology by Jörg Rothe in Back Matter
- Software Engineering 1: Abstraction and Modelling (Texts in Theoretical Computer Science. An EATCS Series) by Dines Bjørner on page
- Extremal Combinatorics: With Applications in Computer Science by Stasys Jukna in Back Matter
See all 35 books citing this book
Books on Related Topics
(learn more)
|
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science > Artificial Intelligence > Theory of Computing
- Books > Computers & Technology > Hardware > Parallel Processing Computers
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Software Development
- Books > New & Used Textbooks > Computer Science
- Books > Science & Math > Mathematics
