Computing Ready Simulations Efficiently
Purushothaman, S. and Zwarico, Amy
Ready simulation is the finest fully abstract notion of process equivalence in the CCS setting. We give an O(mn + n 2)-time algorithm for deciding when n-state, m-transition processes are ready similar; a substantial improvement on the Θ(mn 6) algorithm presented in .
B. Bloom and R. Paige, "Computing Ready Simulations Efficiently," NAPAW: Workshops in Computing, Springer Verlag, Jan 1993.
The definitive version is available at http://dx.doi.org/10.1007/978-1-4471-3217-2_8
Mathematics and Statistics
Article - Journal
© 1993 Springer Verlag, All rights reserved.