Results 1 
1 of
1
From Bisimulation to Simulation  Coarsest Partition Problems
 J. Automated Reasoning
, 2002
"... The notions of bisimulation and simulation are used for graph reduction and are widely employed in many areas: Modal Logic, Concurrency Theory, Set Theory, Formal Verification, etc. In particular, in the context of Formal Verification they are used to tackle the socalled stateexplosion problem. ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
The notions of bisimulation and simulation are used for graph reduction and are widely employed in many areas: Modal Logic, Concurrency Theory, Set Theory, Formal Verification, etc. In particular, in the context of Formal Verification they are used to tackle the socalled stateexplosion problem.