Rank-Based Simulation on Acyclic Graphs

The simulation preorder is widely used both as a behavioral relation in concurrent systems, and as an abstraction tool to reduce the state space in model checking, were memory requirement is clearly a critical issue. Therefore, in this context a simulation algorithm should address both time and space efficiency. In this paper, we rely on the notion of rank to design an efficient simulation algorithm. It turns out that such algorithm outperforms—both in terms of time and in terms of space—the best simulation algorithms in the literature, on the class of acyclic graphs.

[1]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[2]  Silvia Crafa,et al.  Saving Space in a Time Efficient Simulation Algorithm , 2009, ACSD.

[3]  Jean E. Rubin,et al.  Set theory for the mathematician , 1967 .

[4]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[5]  Bard Bloom,et al.  Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem , 1995, Sci. Comput. Program..

[6]  Rob J. van Glabbeek,et al.  Correcting a Space-Efficient Simulation Algorithm , 2008, CAV.

[7]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[8]  Orna Grumberg,et al.  Simulation-based minimization , 2003, TOCL.

[9]  Thomas A. Henzinger,et al.  Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[10]  Francesco Ranzato,et al.  A New Efficient Simulation Equivalence Algorithm , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[11]  Rance Cleaveland,et al.  Simulation Revisited , 2001, TACAS.

[12]  Orna Grumberg,et al.  Model checking and modular verification , 1994, TOPL.

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

[14]  Carla Piazza,et al.  From Bisimulation to Simulation: Coarsest Partition Problems , 2003, Journal of Automated Reasoning.

[15]  Stephan Merz,et al.  Model Checking , 2000 .

[16]  Agostino Dovier,et al.  An efficient algorithm for computing bisimulation equivalence , 2004, Theor. Comput. Sci..

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

[18]  Agostino Dovier,et al.  A Fast Bisimulation Algorithm , 2001, CAV.