The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach

@inproceedings{Shukla1996ThePT,
  title={The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach},
  author={Sandeep K. Shukla and Daniel J. Rosenkrantz and Harry B. Hunt and Richard Edwin Stearns},
  booktitle={Satisfiability Problem: Theory and Applications},
  year={1996}
}
We present a uniform approach for proving the polynomial time decidability of various simulation and equivalence relations for-nite state processes. Our approach involves eecient reductions to the satissability problem for Horn formulas. It applies directly and naturally to most of the simulation preorders and equivalence relations, studied in the literature. Here we illustrate our methodology by deriving eecient algorithms for a number of such relations. For some of these relations, we present… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Hornsat, model checking, veriication and games, To be presented at CAV

  • Shr, S K Shukla, H B Hunt, Iii, D J Rosenkrantz
  • Hornsat, model checking, veriication and games…
  • 1996

Computing simulations on nite and innnite graphs

  • Hhk, M R Henzinger, T Henzinger, P W Kopke
  • Proceedings of IEEE Conference on Foundations of…
  • 1995

Linear time model checking algorithm for alternation-free modal mu calculus

  • R Cleveland, B Steeen
  • Formal Methods of Software Design
  • 1993

Similar Papers

Loading similar papers…