Highly Influenced

# From Bisimulation to Simulation: Coarsest Partition Problems

@article{Gentilini2003FromBT, title={From Bisimulation to Simulation: Coarsest Partition Problems}, author={Raffaella Gentilini and Carla Piazza and Alberto Policriti}, journal={Journal of Automated Reasoning}, year={2003}, volume={31}, pages={73-103} }

- Published in Journal of Automated Reasoning 2003
DOI:10.1023/A:1027328830731

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, and so forth. In particular, in the context of formal verification they are used to tackle the so-called state-explosion problem. The faster algorithms to compute the maximum bisimulation on a given labeled graph are based on the crucial equivalence between maximum bisimulation and relational coarsest partition problem… CONTINUE READING

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 133 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**133**citations based on the available data.See our **FAQ** for additional information.

#### References

##### Publications referenced by this paper.

Showing 1-10 of 43 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential