Re: [tlaplus] Curious: stuttering vs recursive

A good example would be Hoare's CSP( http://www.usingcsp.com/cspbook.pdf ).

For example,

Clock = (tick --> Clock).

And the behavior would be: tick,tick tick....

CSP theory heavily uses the "recursive" concept/term to describe an infinite loop PROCESS.

I was just curious why we adopted the "stuttering", instead of "recursive", to describe the consecutive STEPs that do not change states.

Have a nice weekend,

Mike

On Fri, May 28, 2021 at 11:43 PM Stephan Merz <stephan.merz@xxxxxxxxx> wrote:

I am not aware of the use of "recursive" that you refer to. Could you give a reference?

Stephan

On 27 May 2021, at 05:56, Huailin <huailin@xxxxxxxxx> wrote:

Team,

While the word "stuttering" is really precise for describing that a state is not being updated/changed and stay as is after an action got applied, I am wondering why i feel the "stuttering" semantics herein in TLA+ is equal to the "recursive" in PL or some Formal Method fields.

I am very curious why Lamport proposed the "stuttering", instead of using the "recursive", to describe a state not being changed?:--))))

Thanks,

Mike

--
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/77ba2baf-e2f6-4058-a393-a9b6eabf1016n%40googlegroups.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/DE6B704D-5F30-4AB8-9E64-81D4B0BA4119%40gmail.com.