Simulation reduction as constraint (2002)

by R Gentilini, C Piazza, A Policriti
Venue:Proc. of Workshop on Functional and Constraint Logic Programming (WFLP'02), pages 59--72. Research Report UDMI/18/2002/RR
Add To MetaCart
Results 1 - 1 of 1

From Bisimulation to Simulation - Coarsest Partition Problems

by R. Gentilini, C. Piazza, A. Policriti - 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 so-called state-explosion problem. ..."
Abstract - Cited by 12 (0 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 so-called state-explosion problem.