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}
}
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
Highly Influential
This paper has highly influenced 17 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 132 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

133 Citations

01020'07'10'13'16'19
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

From bisimulation to simulation: Coarsest partition problems, RR 12-2003

  • R. Gentilini, C. Piazza, A. Policriti
  • Dep. of Computer Science,
  • 2003
Highly Influential
5 Excerpts

Simulation revised, in T. Margaria and W. Yi (eds.), Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’01)

  • R. Cleaveland, L. Tan
  • Lecture Notes in Comput. Sci
  • 2001
Highly Influential
13 Excerpts

Computing in Non Standard Set Theories

  • C. Piazza
  • Ph.D. thesis, Department of Computer Science…
  • 2002
1 Excerpt