Computing Ready Simulations Efficiently

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 decid­ ing when n-state, m-transition processes are ready similar; a substantial improvement on the 9(mn6 ) algorithm presented in [4].

[1]  A. Meyer,et al.  Bisimulation can't be traced. Preliminary report , 1987 .

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Jan Friso Groote,et al.  Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract) , 1989, ICALP.

[4]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[5]  Edmond Schonberg,et al.  Programming with Sets: An Introduction to SETL , 1986 .

[6]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[7]  Bloom Bard,et al.  Ready simulation, bisimulation, and the semantics of CCS-like languages , 1989 .

[8]  C.-H. Luke Ong.  The Lazy Lambda Calculus : an investigation into the foundations of functional programming , 1988 .

[9]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[10]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[11]  Iain Phillips,et al.  Refusal Testing , 1986, Theoretical Computer Science.

[12]  John Darlington,et al.  A Transformation System for Developing Recursive Programs , 1977, J. ACM.

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

[14]  Rance Cleaveland,et al.  Computing Behavioural Relations, Logically , 1991, ICALP.

[15]  Robert Paige,et al.  Finite Differencing of Computable Expressions , 1982, TOPL.

[16]  Kim G. Larsen,et al.  Bisimulation through probabilistic testing (preliminary report) , 1989, POPL '89.

[17]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[18]  Robert Paige,et al.  Program Derivation by Fixed Point Computation , 1989, Sci. Comput. Program..

[19]  R. Paige,et al.  Multiset Discrimination - A Method for Implementing Programming Language Systems without Hashing , 1992 .

[20]  Robert Paige,et al.  Real-time Simulation of a Set Machine on a Ram , 1989 .

[21]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[22]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[23]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[24]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[25]  Gérard Boudol,et al.  Algèbre de Processus et Synchronisation , 1984, Theor. Comput. Sci..