W3C home > Mailing lists > Public > www-ws-arch@w3.org > January 2003

Re: Proposed text on reliability in the web services architecture

From: Walden Mathews <waldenm@optonline.net>
Date: Thu, 09 Jan 2003 21:36:37 -0500
To: Assaf Arkin <arkin@intalio.com>, Mark Baker <distobj@acm.org>, "Champion, Mike" <Mike.Champion@SoftwareAG-USA.com>
Cc: www-ws-arch@w3.org
Message-id: <002601c2b851$19a1efa0$1702a8c0@WorkGroup>


> There's a whole class of distributed algorithms that attempt to address
> reliability by defining the system as a composition of automata that is
> based on exactly two operations: read and write. State transitions are
> client derived. The client uses a read operation to determine the current
> state, and a write operation to change it to a new state, with guarantee
> that the same write given the same initial state would always result in
> same terminal state (in other words, all actions are idempotent).

That may be a deterministic finite state machine, but it's not what
idempotent means.  You should check your definition.  For this discussion,
it obviously matter... a lot.

Received on Thursday, 9 January 2003 21:36:44 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 21:41:02 UTC