Strong Bisimulation

More documents

Recommendations

Info

Actions and States Actions: • We presuppose an infinite set N of names; we use a, b, … to range over N. • Then we introduce the set N = { a| a∈N }, which we call co-names. • We assume that N and Nare disjoint, and we denote their union N ∪N , by L, the set of labels (the kind of labels, which identifies the buttons on our black boxes). For the moment, the set L and Σ coincide. Conceptual changes: • What matters about a string s - a sequence of actions - is not whether it drives the automaton into an accepting state (since we cannot detect this by interaction) but whether the automaton is able to perform the sequence of s interactively. • A labeled transition system can be thought of as an automaton without a start or accepting states. • Any state can be considered as the start. 33
General Automaton a,b,c b,c q3 a,b q0 a a q2 c b q1 c 34
Page 1: Strong Bisimulation Overview • Ac
Page 5 and 6: LTS and Automaton An LTS can be tho
Page 7 and 8: Strong Simulation - Definition Let
Page 9 and 10: Defining S If we define S = {(p0, q
Page 11 and 12: Diagrams The condition for S to be
Page 13 and 14: Working With Simulations What do we
Page 15 and 16: Linking States b p0 b a a p1 p2 a a
Page 17 and 18: Reflexivity Let Q be a process and
Page 19 and 20: Transitivity S 1 ° S 2 = {(p, r) |
Page 21: Bisimulation - Summary Bisimulation

Strong Bisimulation

Create successful ePaper yourself

Delete template?

Save as template?