Re: A question of Composite Web Service Verification

See inline

On Thursday, September 25, 2003, at 08:30  pm, Joachim.Peer@unisg.ch 
wrote:

>
>
> hi,
>
>> Can I say a structure is well-formed if the structure satisfies the
> following properties: reachability and deadlock-freedom
>
> in the context of web service composition, McIlraith and Narayanan 
> [1][2]
> mention
> * reachability,
> * liveness and
> * existence/absence of deadlocks.
> as most important _verficication_ problems. However, i can't tell you 
> if
> this equals the criteria of _well-formedness_ as required by your 
> study.
>
>> how to verify the structure used to composite web services is 
>> well-formed
>
> in [1][2], Petri net based algorithms are used to carry out this kind 
> of
> reasoning.

Process Algebra can be used too. See work from Bologna University, 
Honda, Yoshida,.... et al

>
>
> kind regards,
> Joachim Peer
>
> [1] http://citeseer.nj.nec.com/narayanan02simulation.html
> [2] http://www2002.org/presentations/narayanan.pdf
>
>
> This email is confidential and may be protected by legal privilege. If 
> you are not the intended recipient,  please do not copy or disclose 
> its content but  delete the email and contact the sender immediately. 
> Whilst we run antivirus software on all internet emails we are not 
> liable for any loss or damage. The recipient is advised to run their 
> own antivirus software.
>

This email is confidential and may be protected by legal privilege. If you are not the intended recipient,  please do not copy or disclose its content but  delete the email and contact the sender immediately. Whilst we run antivirus software on all internet emails we are not liable for any loss or damage. The recipient is advised to run their own antivirus software.

Received on Friday, 26 September 2003 04:54:11 UTC