- From: Jon Dart <jdart@tibco.com>
- Date: Wed, 30 Jul 2003 14:17:30 -0700
- To: Assaf Arkin <arkin@intalio.com>
- CC: public-ws-chor@w3.org
Assaf Arkin wrote: > A machine processible language would. So if you look at something like WSCI or BPEL4WS abstract, I can easily run it through a validator to check for correctness. Yes, you could run it through a validator of some kind, but can you write a validator that will tell you if a BPEL choreography (for example) can deadlock or not? Having it machine-readable is one thing: having interesting properties like this decidable by machine is another issue. --Jon
Received on Wednesday, 30 July 2003 17:17:53 UTC