[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [tlaplus] liveness, fairness, and the style of writing TLA+
The base algorithm is described in the book "Temporal Verification of Reactive Systems” by Zohar Manna and Amir Pnueli (https://link.springer.com/book/10.1007/978-1-4612-4222-2). However, be aware of the subtle differences, as TLA and LTL are not identical.
Markus
> On Aug 5, 2024, at 8:38 AM, 'Michal Jaszczyk' via tlaplus <tlaplus@xxxxxxxxxxxxxxxx> wrote:
>
> Lastly, where can I find more info about the liveness algorithm itself? I found that it uses SCC decomposition on the state graph, but not much more. I saw something about action tableau, and my understanding is that analyzing just the state graph is not enough.
--
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/8FF1E627-EFD7-4DA0-80A5-29061523A51A%40lemmster.de.
- References:
- [tlaplus] liveness, fairness, and the style of writing TLA+
- From: 'Michal Jaszczyk' via tlaplus
- Re: [tlaplus] liveness, fairness, and the style of writing TLA+
- Re: [tlaplus] liveness, fairness, and the style of writing TLA+
- From: 'Michal Jaszczyk' via tlaplus
- Re: [tlaplus] liveness, fairness, and the style of writing TLA+
- Re: [tlaplus] liveness, fairness, and the style of writing TLA+
- Re: [tlaplus] liveness, fairness, and the style of writing TLA+
- From: 'Michal Jaszczyk' via tlaplus