Communicating and Mobile Systems
Subtitle: the Pi-Calculus
Edition: 1st edition
Publisher: Cambridge University Press
Published: June 15, 1999
Language: eng
Format: Paperback
Number of pages: 161
ISBN-13: 9780521658690
Subjects: Computer Communications & Networking; Programming - General; Computers; Computers - Communications / Networking; Computer Books: Operating Systems; Telecommunications; Computer Science; Computers / Networking / General; Mobile computing; General; Computer Bks - Communications / Networking
First sentence: This book introduces a calculus for analysing properties of concurrent communicating processes, which may grow and shrink and move about.
Table of contents: title: Glossary
pagenum: viii; title: Preface
pagenum: x; label: Part I
title: Communicating Systems
pagenum: 1; label: 1
title: Introduction
pagenum: 3; label: 2
title: Behaviour of Automata
pagenum: 8; label: 2.1
title: Automata
pagenum: 8; label: 2.2
title: Regular sets
pagenum: 10; label: 2.3
title: The language of an automaton
pagenum: 11; label: 2.4
title: Determinism versus nondeterminism
pagenum: 12; label: 2.5
title: Black boxes, or reactive systems
pagenum: 13; label: 2.6
title: Summary
pagenum: 15; label: 3
title: Sequential Processes and Bisimulation
pagenum: 16; label: 3.1
title: Labelled transition systems
pagenum: 16; label: 3.2
title: Strong simulation
pagenum: 17; label: 3.3
title: Strong bisimulation
pagenum: 18; label: 3.4
title: Sequential process expressions
pagenum: 20; label: 3.5
title: Boolean buffer
pagenum: 22; label: 3.6
title: Scheduler
pagenum: 23; label: 3.7
title: Counter
pagenum: 24; label: 3.8
title: Summary
pagenum: 25; label: 4
title: Concurrent Processes and Reaction
pagenum: 26; label: 4.1
title: Labels and flowgraphs
pagenum: 26; label: 4.2
title: Observations and reactions
pagenum: 27; label: 4.3
title: Concurrent process expressions
pagenum: 29; label: 4.4
title: Structural congruence
pagenum: 31; label: 4.5
title: Reaction rules
pagenum: 33; label: 4.6
title: Summary
pagenum: 37; label: 5
title: Transitions and Strong Equivalence
pagenum: 38; label: 5.1
title: Labelled transitions
pagenum: 38; label: 5.2
title: Strong bisimilarity and applications
pagenum: 45; label: 5.3
title: Algebraic properties of strong equivalence
pagenum: 48; label: 5.4
title: Congruence
pagenum: 50; label: 5.5
title: Summary
pagenum: 51; label: 6
title: Observation Equivalence: Theory
pagenum: 52; label: 6.1
title: Observations
pagenum: 52; label: 6.2
title: Weak bisimulation
pagenum: 53; label: 6.3
title: Unique solution of equations
pagenum: 58; label: 6.4
title: Summary
pagenum: 59; label: 7
title: Observation Equivalence: Examples
pagenum: 60; label: 7.1
title: Lottery
pagenum: 60; label: 7.2
title: Job Shop
pagenum: 61; label: 7.3
title: Scheduler
pagenum: 64; label: 7.4
title: Buffer
pagenum: 67; label: 7.5
title: Stack and Counter
pagenum: 69; label: 7.6
title: Discussion
pagenum: 73; label: Part II
title: The π-Calculus
pagenum: 75; label: 8
title: What is Mobility?
pagenum: 77; label: 8.1
title: Limited mobility
pagenum: 79; label: 8.2
title: Mobile phones
pagenum: 80; label: 8.3
title: Other examples of mobility
pagenum: 83; label: 8.4
title: Summary
pagenum: 86; label: 9
title: The π-Calculus and Reaction
pagenum: 87; label: 9.1
title: Names, actions and processes
pagenum: 87; label: 9.2
title: Structural congruence and reaction
pagenum: 89; label: 9.3
title: Mobility
pagenum: 91; label: 9.4
title: The polyadic π-calculus
pagenum: 93; label: 9.5
title: Recursive definitions
pagenum: 94; label: 9.6
title: Abstractions
pagenum: 96; label: 9.7
title: Summary
pagenum: 97; label: 10
title: Applications of the π-Calculus
pagenum: 98; label: 10.1
title: Simple systems
pagenum: 98; label: 10.2
title: Unique handling
pagenum: 100; label: 10.3
title: Data revisited
pagenum: 103; label: 10.4
title: Programming with lists
pagenum: 106; label: 10.5
title: Persistent and mutable data
pagenum: 109; label: 11
title: Sorts, Objects, and Functions
pagenum: 113; label: 11.1
title: A hierarchy of channel types?
pagenum: 113; label: 11.2
title: Sorts and sortings
pagenum: 114; label: 11.3
title: Extending the sort language
pagenum: 116; label: 11.4
title: Object-oriented programming
pagenum: 119; label: 11.5
title: Processes and abstractions as messages
pagenum: 123; label: 11.6
title: Functional computing as name-passing
pagenum: 125; label: 12
title: Commitments and Strong Bisimulation
pagenum: 129; label: 12.1
title: Abstractions and concretions
pagenum: 129; label: 12.2
title: Commitment rules
pagenum: 132; label: 12.3
title: Strong bisimulation, strong equivalence
pagenum: 134; label: 12.4
title: Congruence
pagenum: 136; label: 12.5
title: Basic congruence properties of replication
pagenum: 138; label: 12.6
title: Replicated resources
pagenum: 140; label: 12.7
title: Summary
pagenum: 141; label: 13
title: Observation Equivalence and Examples
pagenum: 142; label: 13.1
title: Experiments
pagenum: 142; label: 13.2
title: Weak bisimulation and congruence
pagenum: 143; label: 13.3
title: Unique solution of equations
pagenum: 145; label: 13.4
title: List programming
pagenum: 146; label: 13.5
title: Imperative programming
pagenum: 147; label: 13.6
title: Elastic buffer
pagenum: 148; label: 13.7
title: Reduction in the λ-calculus
pagenum: 151; label: 14
title: Discussion and related work
pagenum: 153; title: References
pagenum: 157; title: Index
pagenum: 159