Title
Computing Ready Simulations Efficiently
Editor(s)
Purushothaman, S. and Zwarico, Amy
Abstract
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 [4].
Recommended Citation
B. Bloom and R. Paige, "Computing Ready Simulations Efficiently," NAPAW: Workshops in Computing, Springer Verlag, Jan 1993.
The definitive version is available at https://doi.org/10.1007/978-1-4471-3217-2_8
Department(s)
Mathematics and Statistics
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 1993 Springer Verlag, All rights reserved.
Publication Date
01 Jan 1993