for the calculus

Jérôme Feret

Description

GETCO'2000 Occurrences Counting Analysis for the π-calculus Jérôme Feret École normale supérieure feret August 21, 2000

• trace-based analysis


• mobile systems


• ecole normale


• communications allow


• dynamic partitioning


• change structure

Sujets

• École normale

Informations

• Publié par: pefav
• Nombre de lectures: 20
• Langue: English

Extrait

π
∼
r
Coun
sup
ting
21,
Analysis
httpwwin
for
et
the
normale
Occurrences
ieure
alculus
s
GETCO
f
Je
er
F
August
eret
2000
oleπ
(c)
erview
k
1.
T
Mobile
2
systems
analysis
(a)
Dynamic
What
Je
is
w
it
coun
?
Examples
(b)
analysis
Ov
(b)
lo
alculus
(c)
(c)
eret
Nontandard
21,
seman
analysis
tics
Occurrences
2.
ting
Appro
(d)
ximate
3.
the
raceased
collecting
(a)
seman
partitioning
tics
Dead
(a)
c
Abstract
analysis
in
Example
terpretation
F
(b)
LIENS
Con
August
trol
2000
o21,
Mobile
3
systems
LIENS
Je
August
F
2000
eret•
•
•
•
unication
o
F
ol
teraction
of
A
pro
op
cesses
e
whic
August
h
new
p
new
in
cesses
teract
of
via
y
comm
!
unications
LIENS
Comm
2000
unications
create
allo
comm
w
links
to
create
system
pro
sync
T
hronize
ology
pro
in
cess
ma
computation
b
Mobile
un
b
ounded
c
Je
hange
eret
structure
4
of
21,
pro
cesses5
Example
eret
a
21,
serv
LIENS
er
August
Je
2000
F•
•
•
go
W
can
e
a
need
m
a
c
sound
LIENS
description
unicate
of
to
the
of
m
W
ultiset
.
of
2000
the
er
pro
y
cesses
exclusion
that
vide
o
d
ccur
dead
inside
analysis
computation
prop
sequences
olynomial
jectiv
F
to
August
pro
cesses
v
nev
e
comm
that
b
ph
detecting
ysical
utual
resources
;
es
are
pro
not
a
exhausted
o
;
criterion
Ob
partitioning
,
for
to
lo
ree
k
con
.
trol
e
o
ose
w
p
analysis
solution
b
Je
y
eret
detecting
6
that
21,
some
proπ
P P
(P| P)
(P+P)
∅
ic! [x ,...,x ]1 n
ic? [x ,...,x ]1 n
i∗c? [x ,...,x ]1 n
ν x
n> 0
c x x x ∈ i∈1 n
ν ?
FN(P) P BN(P)
P
name
inite
ound
an
names
e
el
b
names
Channel
el
Let
arallel
nput
c
guard
denote
|
the
tax
and
syn
the
:
Channel
alculus
L
action
of
cess
the
pro
W
a
y
of
L
nd
of
comp
|
|
y
hoice
inite
c
of
deterministic
in
eplication
and
guard
::=
|
ab
(
.
on
and
osition
are
)
only
hannel
binders
creation
e
where
b
|
hannel
lab
and
els
ab
,
set
::=
free
,
in
action
,
(A
b
set
essage
.
an
F
set
LIENS
set
August
b
|
names
,
(P
,
Je
...,
eret
ction
7
of
21,
2000
,π
•
i,ji jc? [y]Q| c! [x]P → Q[y← x]| P
i,ji j i∗c? [y]Q| c! [x]P → Q[y← x]|∗c? [y]Q| P
ε
P+Q → P
ε
P+Q → Q
•
α
August
e
omm
the
on
seman
and
tics
-
of
-
the
asso
alculus
F
the
redexs
reduction
renaming
T
ersion
relation
mo
sp
y
ecis
y
the
on
result
LIENS
of
2000
pro
-
cess
names
relation
(
giv
computations
v
ransition
-
seman
structural
tics
diations
congruence
utativit
A
,
reduction
ciativit
relation
,
and
so
a
Je
the
eret
congruence
8
relation
21,
rev
ealsS ν
5 6 7
0∗ ν ν ν
1
2 3 4
21,
!
].(
ort
|
[]
]
|
p
p
[
ort
[
!
!
p
in
[]
query
|
?
p
esp
ort
!
!
esp
(
p
[])
LIENS
where
(
Instance
!
:=
[
:=
]
p
in
ort
|
?
r
tax
onse
[](
out
syn
Instance
in
r
)(
onse
Example
|
ort
ort
[]))
F
2000
Je
)(
eret
(
9
August
query
)
outν
5 6 7
(0,5)
→
ν ν ν ν1 1 1
6 7
1
1 1
2 3 4
1 1
(2,1)
→
ν ν ν ν1 1 1
4 6 7
3
1 1
p
)
[])
(
|
Instance
(
|
(
p
ort
ort
ort
!
ort
(
ort
[]
ort
|
|
p
|
ort
p
!
[]
ort
p
[]
p
|
(
in
!
p
|
!
[]
(
ort
[
|
query
p
computation
ort
]
query
|
out
in
)(
Instance
in
?
|
Example
ort
LIENS
in
August
)(
2000
out
onse
)(
]
query
.(
)
out
Instance
query
p
!
!
|
[]
])
p
eret
!
esp
[]
onse
p
]
!
|
[]
p
out
ort
!
!
[
)(
[]))
!
Je
F
[
r
10
[
21,
r
esp