Saving Space in a Time Efficient Simulation Algorithm

A number of algorithms are available for computing the simulation relation on Kripke structures and on labelled transition systems representing concurrent systems. Among them, the algorithm by Ranzato and Tapparo [2007] has the best time complexity, while the algorithm by Gentilini et al. [2003]

• Type: Conference
• Year: 2009
• Where: ACSD
• Authors: Silvia Crafa, Francesco Ranzato, Francesco Tapparo
• Keywords: ACSD 2009, Algorithm, Gentilini Et Al, Hardware, Simulation Algorithm