![Page 1: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/1.jpg)
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
![Page 2: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/2.jpg)
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
![Page 3: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/3.jpg)
3
![Page 4: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/4.jpg)
4
![Page 5: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/5.jpg)
5
Meaning of CCS Operators
![Page 6: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/6.jpg)
6
Notational Conventions
![Page 7: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/7.jpg)
7
Labelled Transition System
![Page 8: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/8.jpg)
8
Semantics of CCS
![Page 9: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/9.jpg)
9
Semantics of CCS
![Page 10: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/10.jpg)
10
Semantics of CCS
![Page 11: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/11.jpg)
11
Semantics of CCS
![Page 12: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/12.jpg)
12
Recursion
![Page 13: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/13.jpg)
13
Equivalence
![Page 14: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/14.jpg)
14
Equivalence of CCS Processes
![Page 15: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/15.jpg)
15
Desired Properties of Equivalence
![Page 16: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/16.jpg)
16
Congruence
![Page 17: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/17.jpg)
17
Trace Equivalence
![Page 18: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/18.jpg)
18
Trace Equivalence
![Page 19: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/19.jpg)
19
Congruence
![Page 20: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/20.jpg)
20
Trace Equivalence
![Page 21: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/21.jpg)
21
Trace Equivalence
![Page 22: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/22.jpg)
22
Deadlock
![Page 23: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/23.jpg)
23
Deadlock
![Page 24: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/24.jpg)
24
Desired Properties of Equivalence
![Page 25: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/25.jpg)
25
Strong Bisimulation
![Page 26: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/26.jpg)
26
Strong Bisimulation
![Page 27: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/27.jpg)
27
Strong Bisimulation
![Page 28: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/28.jpg)
28
Strong Bisimulation
How to prove this?
![Page 29: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/29.jpg)
29
Strong Bisimulation
How to prove this?
![Page 30: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/30.jpg)
30
Properties of Strong Bisimulation
![Page 31: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/31.jpg)
31
Strong Bisimulation => Trace Equivalence
![Page 32: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/32.jpg)
32
Congruence Property
Makes use of following Lemma
![Page 33: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/33.jpg)
33
Congruence
![Page 34: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/34.jpg)
34
Deadlock
![Page 35: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/35.jpg)
35
Summary
![Page 36: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/36.jpg)
36
Traces and Deadlocks
![Page 37: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/37.jpg)
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
![Page 38: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/38.jpg)
38
Partition Refinement Algorithm
![Page 39: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/39.jpg)
39
Strong Simulation
![Page 40: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/40.jpg)
40
Strong Simulation and Bisimulation
![Page 41: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/41.jpg)
41
Strong Bisimulation is not an ideal solution!
![Page 42: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/42.jpg)
42
Weak Bisimulation
![Page 43: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/43.jpg)
43
Weak Bisimulation
![Page 44: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/44.jpg)
44
Weak Bisimulation
![Page 45: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/45.jpg)
45
Weak Bisimulation
![Page 46: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/46.jpg)
46
Weak Bisimulation
![Page 47: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/47.jpg)
47
Weak Bisimulation
![Page 48: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/48.jpg)
48
Weak Bisimulation
![Page 49: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/49.jpg)
49
Properties of Weak Bisimulation
![Page 50: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/50.jpg)
50
Properties of Weak Bisimulation
![Page 51: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/51.jpg)
51
Observation Congruence
![Page 52: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/52.jpg)
52
Observation Congruence
![Page 53: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/53.jpg)
53
Observation Congruence
![Page 54: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/54.jpg)
54
Observation Congruence
![Page 55: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/55.jpg)
55
Observation Congruence
![Page 56: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/56.jpg)
56
Observation Congruence
![Page 57: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/57.jpg)
57
Observation Congruence
![Page 58: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/58.jpg)
58
Observation Congruence
![Page 59: CS780 Discrete-State Models - William & Marykemper/cs780_08/slides/V_CCS.pdf · 37 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM](https://reader033.vdocuments.us/reader033/viewer/2022050119/5f50046caf2f0f2df907bc2c/html5/thumbnails/59.jpg)
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