cs780 discrete-state models - william & marykemper/cs780_08/slides/v_ccs.pdf · 37 computing...
TRANSCRIPT
1
CS780 Discrete-State Models
Today:Milner‘s Calculus of Communicating SystemsStrong & Weak BisimulationObservational Congruence
Quick Reference:Robin Milner, A Calculus of Communicating Systems,Springer, LNCS 92, 1980.Robin Miner, Communication and Concurrency, Prentice Hall,1989.
Instructor: Peter KemperR 006, phone 221-3462, email:[email protected] hours: Mon,Wed 3-5 pm
2
Outline
Origin of Process Algebras:Calculus of Communicating Systems (CCS)Trace EquivalenceBisimulation Strong Weak
Observational Congruence
Credits: Slides from Noll, Katoen, RWTH Aachen, Germany, 2007/08
3
4
5
Meaning of CCS Operators
6
Notational Conventions
7
Labelled Transition System
8
Semantics of CCS
9
Semantics of CCS
10
Semantics of CCS
11
Semantics of CCS
12
Recursion
13
Equivalence
14
Equivalence of CCS Processes
15
Desired Properties of Equivalence
16
Congruence
17
Trace Equivalence
18
Trace Equivalence
19
Congruence
20
Trace Equivalence
21
Trace Equivalence
22
Deadlock
23
Deadlock
24
Desired Properties of Equivalence
25
Strong Bisimulation
26
Strong Bisimulation
27
Strong Bisimulation
28
Strong Bisimulation
How to prove this?
29
Strong Bisimulation
How to prove this?
30
Properties of Strong Bisimulation
31
Strong Bisimulation => Trace Equivalence
32
Congruence Property
Makes use of following Lemma
33
Congruence
34
Deadlock
35
Summary
36
Traces and Deadlocks
37
Computing Equivalences
Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM J. Computing,
16, 1987.Multiple variants and refinements, in particular wrt stochastic models P. Buchholz. Exact and ordinary lumpability in finite Markov chains.
Journal of Applied Probability, 31:59–75, 1994. S. Derisavi, H. Hermanns, and W. H. Sanders. Optimal State-Space
Lumping in Markov Chains, Information Proc. Letters, 87, 6, 2003
38
Partition Refinement Algorithm
39
Strong Simulation
40
Strong Simulation and Bisimulation
41
Strong Bisimulation is not an ideal solution!
42
Weak Bisimulation
43
Weak Bisimulation
44
Weak Bisimulation
45
Weak Bisimulation
46
Weak Bisimulation
47
Weak Bisimulation
48
Weak Bisimulation
49
Properties of Weak Bisimulation
50
Properties of Weak Bisimulation
51
Observation Congruence
52
Observation Congruence
53
Observation Congruence
54
Observation Congruence
55
Observation Congruence
56
Observation Congruence
57
Observation Congruence
58
Observation Congruence
59
Summary
Origin of Process Algebras:Calculus of Communicating Systems (CCS)Trace Equivalence Insensitive to deadlocks!
Bisimulation Strong Bisimulation:
too restrictive to be used for an equivalence between an abstractspecification and a detailed implementation model,we need to abstract from internal operations
Weak Bisimulation:no congruence wrt to choice, problem is an initial Tau step
Observational Congruence Compromise between strong and week bisimulation Yields congruence wrt CCS operations
Equivalence classes can be determined with algorithms based onpartition refinement