Refinement in branching time semantics

In this paper we consider branching time semantics for finite sequential processes with silent moves. We show that Mllner's notion of observation equivalence is not preserved under refinement of actions, even when no interleaving operators are considered; however, the authors' notion of branching bislmu/ation is.

[1]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[2]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[3]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.