Hello,--in reply to your original question: without fairness conditions, any specification admits executions that stutter forever. For such a specification Spec,Spec => <>P is valid only if Spec => Pis, that is, if the property P holds initially.There are many examples for checking termination and liveness properties. A simple one is the N-Queens specification [1].For more information about fairness and liveness in TLA, you may want to watch episode 9 of the video lectures [2].Regards,StephanOn 29 Feb 2020, at 13:31, Amirhossein Sayyadabdi <amir.ahsa.2011@xxxxxxxxx> wrote:If there is any example on checking the termination of algorithms that I can use, please kindly let me know. Thank you.AmirhosseinOn Sat, Feb 29, 2020, 2:03 PM Amirhossein Sayyadabdi <amir.ahsa.2011@xxxxxxxxx> wrote:Hi everyone,Is it possible to use TLC to check termination property without specifying any fairness in a spec?I have been trying to check a termination property but it looks like it keeps failing due to stuttering steps!!!Amirhossein--
You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+unsubscribe@xxxxxxxxxxxxxxxx.
To view this discussion on the web visit https://groups.google.com/d/msgid/tlaplus/CAKxfy0tPSwCTA_%2Bo2_AqG29QGz52dBijRUac4EE9ERFt7Hvt%2Bw%40mail.gmail.com.
You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+unsubscribe@xxxxxxxxxxxxxxxx.
To view this discussion on the web visit https://groups.google.com/d/msgid/tlaplus/B1152BC5-2AFB-4BA9-8BC7-59618EDC87D7%40gmail.com.