Analysis of Realizability Conditions for Web Service Choreographies

DOI10.1007/11888116_5zbMath1225.68032OpenAlexW1583751030WikidataQ59702077 ScholiaQ59702077MaRDI QIDQ3613058

Marco Pistore, Raman Kazhamiakin

Publication date: 11 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11888116_5

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Internet topics (68M11)

Related Items (5)

Minimum-cost delegation in service composition ⋮ Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions ⋮ A WSDL-based type system for asynchronous WS-BPEL processes ⋮ Analysis of Realizability Conditions for Web Service Choreographies ⋮ Realizable temporal logics for web service choreography

Uses Software

• WSAT

Cites Work

• Unnamed Item
• Conversation protocols: a formalism for specification and verification of reactive electronic services
• Analysis of Realizability Conditions for Web Service Choreographies
• On Communicating Finite-State Machines
• Computer Aided Verification

This page was built for publication: Analysis of Realizability Conditions for Web Service Choreographies