An edition of Communicating and Mobile Systems (1999)

Communicating and Mobile Systems

the Pi-Calculus

1st edition

by

  • ★★★ 3.0 (1 rating)
  • 4 Want to read
  • 1 Have read
Cover of: Communicating and Mobile Systems by Robin Milner, Robin Milner
Preview Only

My Reading Lists:

Create a new list
Notes
  • ★★★ 3.0 (1 rating)
  • 4 Want to read
  • 1 Have read
Notes

Check nearby libraries

Buy this book

Last edited by Drini
September 23, 2025 | History
Edit
An edition of Communicating and Mobile Systems (1999)

Communicating and Mobile Systems

the Pi-Calculus

1st edition

by

  • ★★★ 3.0 (1 rating)
  • 4 Want to read
  • 1 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Cambridge University Press
Language
English
Pages
161

Check nearby libraries

Buy this book

Previews available in: English

Subjects

Mobile communication systems, Mobile computing, Telecommunication systems, Pi-calculus, Computer networks, Mathematical models, Digital communications, Electronic data processing
Edition Availability
Cover of: Communicating and Mobile Systems
Communicating and Mobile Systems: the Pi-Calculus
June 15, 1999, Cambridge University Press
Hardcover in English - 1st edition
Cover of: Communicating and Mobile Systems
Communicating and Mobile Systems: the Pi-Calculus
June 15, 1999, Cambridge University Press
Paperback in English - 1st edition

Add another edition?

Book Details

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

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

Classifications

Library of Congress
QA76.59

The Physical Object

Format
Paperback
Number of pages
161
Dimensions
9 x 6.3 x 0.5 inches
Weight
9.6 ounces

Edition Identifiers

Open Library
OL7750582M
ISBN 10
0521658691
ISBN 13
9780521658690
LibraryThing
195710
Goodreads
155962

Work Identifiers

Work ID
OL7950513W

Source records

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

Loading indicator
Loading carousel
Loading indicator
Loading carousel

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
September 23, 2025 Edited by Drini Add TOC from Tocky
October 10, 2020 Edited by ImportBot import existing book
August 4, 2020 Edited by ImportBot import existing book
April 5, 2014 Edited by ImportBot Added IA ID.
April 29, 2008 Created by an anonymous user Imported from amazon.com record