The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic

@inproceedings{Kaivola1992TheWC,
  title={The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic},
  author={Roope Kaivola and Antti Valmari},
  booktitle={CONCUR},
  year={1992}
}
A b s t r a c t . Temporal logic model checking is a useful method for verifying properties of finite-state concurrent systems. However, due to the state explosion problem modular methods like compositional minimisation based on semantic congruences are essential in making the verification task manageable. In this paper we show that the so-called CFFD-equivalence defined by initial stability, infinite traces, divergence traces and stable failures is exactly the weakest compositional equivalence… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Bisimulation Equivalence and Divergence in CCS , University of Edinburgh , LFCS Report Series ECS - LFCS - 87 - 29 , 1987

  • A. Valmari

Similar Papers

Loading similar papers…