Towards Action-Refinement in Process Algebras
暂无分享,去创建一个
Abstract We present a simple process algebra which supports a form of refinement of an action by a process and address the question of an appropriate equivalence relation for it. The main result of the paper is that an adequate equivalence can be defined in a very intuitive manner. In fact we show that it coincides with the timed-equivalence proposed by one of the authors. We also show that it can be characterized equationally.
[1] Robin Milner,et al. Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[2] Luca Aceto,et al. Towards action-refinement in process algebras , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[3] Samson Abramsky,et al. Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..