Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Milner R. — Communicating and Mobile Systems: the Pi-Calculus
Milner R. — Communicating and Mobile Systems: the Pi-Calculus



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Communicating and Mobile Systems: the Pi-Calculus

Автор: Milner R.

Аннотация:

Communication is a fundamental and integral part of computing, whether between different computers on a network, or between components within a single computer. In this book Robin Milner introduces a new way of modelling communication that reflects its position. He treats computers and their programs as themselves built from communicating parts, rather than adding communication as an extra level of activity. Everything is introduced by means of examples, such as mobile phones, job schedualers, vending machines, data structures, and the objects of object-oriented programming. But the aim of the book is to develop a theory, the pi-calculus, in which these things can be treated rigorously. The pi-calculus differs from other models of communicating behaviour mainly in its treatment of mobility. The movement of a piece of data inside a computer program is treated exactly the same as the transfer of a message — or indeed an entire computer program — across the internet. One can also describe networks which reconfigure themselves. The calculus is very simple but powerful; its most prominent ingredient is the notion of a name. Its theory has two important ingredients: the concept of behavioural (or observational) equivalence, and the use of a new theory of types to classify patterns of interactive behaviour. The internet, and its communication protocols, fall within the scope of the theory just as much as computer programs, data structures, algorithms and programming languages. This book is the first textbook on the subject; it has been long-awaited by professionals and will be welcome by them, and their students.


Язык: en

Рубрика: Технология/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1999

Количество страниц: 161

Добавлена в каталог: 31.10.2006

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Abstraction      96 106 124 129
action      16 29
Action prefix      87 94
Action, complementary      16
Action, internal      29 34
Action, observable      28 52
Action, unobservable      87
Agent      6 130
Alpha-conversion      29 32 96
Ambient      78
angle brackets      22 82 88
Application      131
Arden's rale      11
Arity      96
Automaton      6 8 9
Behaviour      4 8
Behaviour, external      36
Behaviour, internal      36
Bisimulation      16 37
Bisimulation, strong      18 45 129 134
Bisimulation, strong, up to $\equiv$      47 135
Bisimulation, weak      54 144
Bisimulation, weak, up to $\sim$      54 144
Black Box      13 26
Bound name      see "Name"
Buffer      22 67 84 95 97 103
Buffer, elastic      148
Buffer, two-way      43
Button      13 23 26 36 104
Calculus of Communicating Systems      5
CCS      5 78 153
cell      36 67 85
Cell, buffer      118
Cell, mutable      110
Cell, reference      110 118 120
Channel      82
class      119
Client      83
Co-name      16 92
Commitment      129 132
Communicating processes      3
Communicating Sequential Processes      6
Complement      26 28
Complementary action      see "Action"
Component      6
composition      29 87
Composition, sequential      49 97
Concretion      104 129
Concurrent process      see "Process"
Concurrent process expression      see "Process expression"
Congruence      37
Congruence, agent      137
Congruence, process      31 50 89
Congruence, process, strong      50
Congruence, process, weak      57
Congruence, structural      21 31 40 45 71 90 91 133
constructor      105
context      37
Context, process      31 89
Counter      24 70
CSP      6 153
Data structure      67 98
Data type      105
Data, ephemeral      103
Data, mutable      110
Data, persistent      109
Deadlock      20 24 44
Defining equation      21 30
Derivative      16
Deterministic      9
Distributive law      11
Equivalence relation      19
Equivalence, observation      54 109 142 144
Equivalence, strong      18 48 97 134 137
Equivalence, weak      54 127
Expansion law      49 135
Experiment      52 142
External behaviour      see "Behaviour"
Finite-state      9
Flowgraph      27 91
Forgetful      101 116
Free name      see "Name"
Function      113
Functional programming      98 106 125 152
Guarded      87
handshake      3 27
Hole in context      31 89
Induction on inference      40
Inference      see "Induction"
Interaction      77
Internal action      see "Action"
Internal behaviour      see "Behaviour"
Invariant      see "Reaction"
Job shop      61
Label      16 26 92
Labelled transition system      16 38
Lambda calculus      125 151
Language      9
Linking      33 50 67 85 96
List, ephemeral      106
List, persistent      110
Location      78
Lottery      35 60
LTS      see "Labelled transition system"
Menu      104 106 130
Message      82 95
method      119
Method override      123
Method update      123
Mobile phone      115
Mobile phones      80
Mobility      xi 6 77 84 91 98
NAME      16 82 92 103
Name of object      119
Name, bound      29 88
Name, free      29 88 124
nondeterministic      12
Object-oriented      113 119
Observable action      see "Action"
Observation      28 35 52
Observation equivalence      see "Equivalence"
Parametric process      94 96
Petri net      28
Pi calculus      77 87
Pi calculus, monadic      87
Pi calculus, polyadic      94
Port      13 26 32 36
Prefix      13
Prefix-closed      13
Process      6
Process congruence      see "Congruence"
Process context      see "Context"
Process expression      20 87
Process expression, concurrent      29
Process expression, sequential      21
Process identifier      21 94
Process, concurrent      26 38
Process, sequential      16 22
Protocol      81
Protocol, cryptographic      94
QUEUE      25 72
Reaction      15 28 34 88 91 94 115 131
Reaction relation      34 91
Reaction, invariant under      98 99
Recursive definition      94
Redex      88 91
Regular set      10
Relational composition      41 46
Replication      88 94 138
Resource      83
Restriction      29 87
Restriction, scope of      92
Scheduler      23 64
Semaphore      45
Sequential composition      see "Composition"
Sequential process      see "Process"
Sequential process expression      see "Process expression"
Silent transition      see "Transition"
Simple system      98
Simulation      40
Simulation, strong      17 134
Simulation, strong, up to $\equiv$      47 135
Simulation, weak      53 143
Simulation, weak, up to $\sim$      54 144
sort      113
Sort constructor      117
Sort language      118
Sorting      103 113
Source      16
Specification      60
Spi calculus      94
Stable      35 68 71
STACK      25 70
Standard form      32 49 90 98
State      9
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2020
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте