Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ACSD
2009
IEEE

favoriteEmaildiscussreport

87views Hardware» more ACSD 2009»

Saving Space in a Time Efficient Simulation Algorithm

13 years 8 months ago

Saving Space in a Time Efficient Simulation Algorithm

Download www.math.unipd.it

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]

Silvia Crafa, Francesco Ranzato, Francesco Tapparo

Real-time Traffic

ACSD 2009 | Algorithm | Gentilini Et Al | Hardware | Simulation Algorithm |

claim paper

Related Content

» TimeSpace Efficient Simulations of Quantum Computations

» Correcting a SpaceEfficient Simulation Algorithm

» A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms

» Reduced Complexity ML Detection for Differential Unitary SpaceTime Modulation with Carrier...

» Optimistic distributed timed cosimulation based on thread simulation model

» Efficient resource allocation and power saving in multitiered systems

» pMANET Efficient Power Saving Protocol for MultiHop Mobile Ad Hoc Networks

» EnergyEfficient SpaceTime Coded Cooperative Routing in Multihop Wireless Networks

» Efficient Distributed Algorithms to Build Inverted Files

Post Info
More Details (n/a)

Added	12 Aug 2010
Updated	12 Aug 2010
Type	Conference
Year	2009
Where	ACSD
Authors	Silvia Crafa, Francesco Ranzato, Francesco Tapparo

Comments (0)