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. --JonReceived on Wednesday, 30 July 2003 17:17:53 GMT
This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 27 October 2009 06:36:10 GMT