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={R. Kaivola and A. Valmari},
  booktitle={CONCUR},
  year={1992}
}
  • R. Kaivola, A. Valmari
  • Published in CONCUR 1992
  • Computer Science
  • 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 preserving… CONTINUE READING
    Computation Tree Logic with Deadlock Detection
    36
    Compositional Failure-based Equivalence of Constraint Automata
    2
    Compositional failure-based semantic models for Basic LOTOS
    49
    Weakest-Congruence Results for Livelock-Preserving Equivalences
    22
    All Linear-Time Congruences for Finite LTSs and Familiar Operators
    5
    A Counterexample-Based Incremental and Modular Verification Approach
    4
    All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs
    1

    References

    Publications referenced by this paper.
    SHOWING 1-4 OF 4 REFERENCES
    Communication and concurrency
    7600
    Bisimulation Equivalence and Divergence in CCS , University of Edinburgh , LFCS Report Series ECS - LFCS - 87 - 29 , 1987