Bharat Adsul, Madhavan Mukund, K. Narayan Kumar & Vasumathi Narayanan (2005):
Causal Closure for MSC Languages.
In: R. Ramanujam & Sandeep Sen: FSTTCS,
Lecture Notes in Computer Science 3821.
Springer,
pp. 335–347.
Available at http://dx.doi.org/10.1007/11590156_27.
Rajeev Alur, Kousha Etessami & Mihalis Yannakakis (2005):
Realizability and verification of MSC graphs.
Theor. Comput. Sci. 331(1),
pp. 97–114.
Available at http://dx.doi.org/10.1016/j.tcs.2004.09.034.
Samik Basu, Tevfik Bultan & Meriem Ouederni (2012):
Deciding choreography realizability.
In: POPL,
pp. 191–202.
Available at http://doi.acm.org/10.1145/2103656.2103680.
Tevfik Bultan, Chris Ferguson & Xiang Fu (2009):
A Tool for Choreography Analysis Using Collaboration Diagrams.
In: ICWS,
pp. 856–863.
Available at http://dx.doi.org/10.1109/ICWS.2009.100.
Tevfik Bultan & Xiang Fu (2008):
Specification of realizable service conversations using collaboration diagrams.
Service Oriented Computing and Applications 2(1),
pp. 27–39.
Available at http://dx.doi.org/10.1007/s11761-008-0022-7.
Tevfik Bultan, Xiang Fu, Richard Hull & Jianwen Su (2003):
Conversation specification: a new approach to design and analysis of e-service composition.
In: WWW,
pp. 403–410.
Available at http://doi.acm.org/10.1145/775152.775210.
Tevfik Bultan, Xiang Fu & Jianwen Su (2007):
Analyzing Conversations: Realizability, Synchronizability, and Verification.
In: Test and Analysis of Web Services,
pp. 57–85.
Available at http://dx.doi.org/10.1007/978-3-540-72912-9_3.
Marco Carbone, Kohei Honda & Nobuko Yoshida (2007):
Structured Communication-Centred Programming for Web Services.
In: ESOP,
pp. 2–17.
Available at http://dx.doi.org/10.1007/978-3-540-71316-6_2.
Edmund M. Clarke, Orna Grumberg & Doron Peled (2000):
Model Checking.
MIT Press.
Manuel Fähndrich, Mark Aiken, Chris Hawblitzel, Orion Hodson, Galen C. Hunt, James R. Larus & Steven Levi (2006):
Language support for fast and reliable message-based communication in singularity OS.
In: EuroSys,
pp. 177–190.
Available at http://doi.acm.org/10.1145/1217935.1217953.
X. Fu (2004):
Formal Specification and Verification of Asynchronously Communicating Web Services.
University of California, Santa Barbara.
Xiang Fu, Tevfik Bultan & Jianwen Su (2004):
Conversation protocols: a formalism for specification and verification of reactive electronic services.
Theor. Comput. Sci. 328(1-2),
pp. 19–37.
Available at http://dx.doi.org/10.1016/j.tcs.2004.07.004.
Sylvain Hallé & Tevfik Bultan (2010):
Realizability analysis for message-based interactions using shared-state projections.
In: SIGSOFT FSE,
pp. 27–36.
Available at http://doi.acm.org/10.1145/1882291.1882298.
Kohei Honda, Nobuko Yoshida & Marco Carbone (2008):
Multiparty asynchronous session types.
In: POPL,
pp. 273–284.
Available at http://doi.acm.org/10.1145/1328438.1328472.
Nickolas Kavantzas, David Burdett, Gregory Ritzinger, Tony Fletcher, Yves Lafon & Charlton Barreto (2005):
Web Services Choreography Description Language Version 1.0.
Technical Report.
http://www.w3.org/TR/ws-cdl-10/.
Raman Kazhamiakin & Marco Pistore (2006):
Analysis of Realizability Conditions for Web Service Choreographies.
In: FORTE,
pp. 61–76.
Available at http://dx.doi.org/10.1007/11888116_5.
Ashley T. McNeile (2010):
Protocol contracts with application to choreographed multiparty collaborations.
Service Oriented Computing and Applications 4(2),
pp. 109–136.
Available at http://dx.doi.org/10.1007/s11761-010-0060-9.
Ashley T. McNeile & Nicholas Simons (2006):
Protocol modelling: A modelling approach that supports reusable behavioural abstractions.
Software and System Modeling 5(1),
pp. 91–107.
Available at http://dx.doi.org/10.1007/s10270-005-0100-7.
B. Meenakshi & R. Ramanujam (2000):
Reasoning about Message Passing in Finite State Environments.
In: ICALP,
pp. 487–498.
Available at http://dx.doi.org/10.1007/3-540-45022-X_41.
Ekkart Rudolph, Peter Graubmann & Jens Grabowski (1996):
Tutorial on Message Sequence Charts.
Computer Networks and ISDN Systems 28(12),
pp. 1629–1641.
Available at http://dx.doi.org/10.1016/0169-7552(95)00122-0.
Gwen Salaün, Tevfik Bultan & Nima Roohi (2012):
Realizability of Choreographies Using Process Algebra Encodings.
IEEE T. Services Computing 5(3),
pp. 290–304.
Available at http://doi.ieeecomputersociety.org/10.1109/TSC.2011.9.
Jianwen Su, Tevfik Bultan, Xiang Fu & Xiangpeng Zhao (2007):
Towards a Theory of Web Service Choreographies.
In: WS-FM,
pp. 1–16.
Available at http://dx.doi.org/10.1007/978-3-540-79230-7_1.
P. S. Thiagarajan (1995):
A Trace Consistent Subset of PTL.
In: Insup Lee & Scott A. Smolka: CONCUR,
Lecture Notes in Computer Science 962.
Springer,
pp. 438–452.
Available at http://dx.doi.org/10.1007/3-540-60218-6_33.
eptcs@eptcs.org