J. C. M. Baeten, J. A. Berstra, J. W. Klop, `Ready Trace semantics for concrete algebra with the priority operator', the Computer Journal, 1987, 30, vol 6, pp498-506.  Home/Search   Document Not in Database   Summary   Related Articles

....oe between failure trace and strong bisimulation P oe Q iff P F tr Q . Define f P F tr = f S (P ) one can prove P F tr Q iff j= f S (P ) f S (Q ) 27 5.3 Ready Trace Equivalence This equivalence has occurred in the literature under various guises. See [22] [1] or [23] for example. Take j = a 1 X 1 a 2 X 2 Delta Delta Delta where the a i are action names and the X i are finite sets of action names. Write P j= j iff there is a sequence of transformations P = P 0 a 1 Gamma P 1 a 2 Gamma P 2 a 2 Gamma Delta Delta Delta and for each i, X ....

J. C. M. Baeten, J. A. Berstra, J. W. Klop, `Ready Trace semantics for concrete algebra with the priority operator', the Computer Journal, 1987, 30, vol 6, pp498-506.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC