Simulation revisited

MaRDI QIDQ2771063zbMATH OpenFDO

Authors Li Tan, Rance Cleaveland

Publication date 14 February 2002

zbMATH Keywords

simulation algorithm

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• An efficient simulation algorithm based on abstract interpretation
• An algorithm for computing simulation on finite labeled transition systems
• Foundation for a series of efficient simulation algorithms

Cited in

(15)

• Probabilistic weak simulation is decidable in polynomial time
• An efficient simulation algorithm based on abstract interpretation
• Achieving efficiency and accuracy in simulation for I/O-intensive applications
• Transformational design and implementation of a new efficient solution to the ready simulation problem
• A space-efficient simulation algorithm on probabilistic automata
• An algorithm for computing simulation on finite labeled transition systems
• scientific article; zbMATH DE number 5070674 (Why is no real title available?)
• Correcting a Space-Efficient Simulation Algorithm
• A Space-Efficient Probabilistic Simulation Algorithm
• Using optimal simulations to reduce reachability graphs
• On systematic simulation of open continuous systems
• Why is simulation harder than bisimulation?
• Structural and behavioral equivalence of simulation models
• The reachable simulation problem
• Generalizing the Paige-Tarjan algorithm by abstract interpretation

This page was built for publication: Simulation revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2771063)