Conversation protocols: A formalism for specification and verification of reactive electronic services

Theoretical Computer Science

Volumn 328, Issue 1-2, 2004, Pages 19-37

  Fu, Xiang ^a   Bultan, Tevfik ^a   Su, Jianwen ^a  

^a University of California   (United States)

Author keywords

Asynchronous communication; Communicating finite state automata; Composition; Conversation protocol; E Service; Realizability; Verification

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTER SOFTWARE; FINITE AUTOMATA; PROJECT MANAGEMENT; SPECIFICATIONS; STANDARDS; VIRTUAL REALITY; WORLD WIDE WEB;

ASYNCHRONOUS COMMUNICATION; COMMUNICATION FINITE STATE AUTOMATA; CONVERSATION PROTOCOLS; E-SERVICES; REALIZABILITY; VERIFICATION;

NETWORK PROTOCOLS;

EID: 9544247758     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.07.004     Document Type: Conference Paper

References (32)

1. M. Abadi, L. Lamport, P. Wolper, Realizable and unrealizable specifications of reactive systems, in: Proc. of 16th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 372, Springer, Berlin, 1989, pp. 1-17.
2. P. Abdulla, B. Jonsson, Verifying programs with unreliable channels, Inform. Comput. 127 (2) (1996) 91-101.
3. L.D. Alfaro, T.A. Henzinger, Interface automata, in: Proc. Ninth Annual Symp. on Foundations of Software Engineering,2001, pp. 109-120.
4. R. Alur, K. Etessami, M. Yannakakis, Realizability and verification of MSC graphs, in: Proc. 28th Internat. Colloq. on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 2076, 2001, pp. 797-808.
5. R. Alur, K. McMillan, D. Peled, Model-checking of correctness conditions for concurrent objects, Inform. Comput. 160 (2000) 167-188.
6. Business Process Execution Language for Web Services (BPEL), Version 1.1. http://www.ibm.com/developerworks/library/ws-bpel, May 2003.
7. Business Process Modeling Language (BPML). http://www.bpmi.org.
8. D. Brand, P. Zafiropulo, On communicating finite-state machines, J. ACM 30 (2) (1983) 323-342.
9. T. Bultan, X. Fu, R. Hull, J. Su, Conversation specification: a new approach to design and analysis of e-service composition, in: Proc. 12th Internat. World Wide Web Conf.,2003, pp. 403-410.
10. M. Chiodo, P. Giusto, A. Jurecska, L. Lavagno, H. Hsieh, A. Sangiovanni-Vincentelli, A formal specification model for hardware/software codesign, in: Proc. of the Internat. Workshop on Hardware-Software Codesign, October 1993.
11. E.M. Clarke, O. Grumberg, D.A. Peled, Model Checking, The MIT Press, Cambridge, MA, 2000.
12. C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakakis, Memory-efficient algorithms for the verification of temporal properties, Formal Methods System Design 1 (1992) 275-288.
13. E.A. Emerson, Temporal and modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 995-1072.
14. A. Finkel, P. McKenzie, Verifying identical communicating processes is undecidable, Theoret. Comput. Sci. 174 (1-2) (1997) 217-230.
15. X. Fu, T. Bultan, J. Su, Conversation protocols: a formalism for specification and verification of reactive electronic services, in: Proc. Eighth Internat. Conf. on Implementation and Application of Automata, Lecture Notes in Computer Science, Vol. 2759, July 2003, pp. 188-200.
16. S.J. Garland, N. Lynch, Using I/O automata for developing distributed systems, Foundations of Component Based Systems, Cambridge University Press, Cambridge, 2000.
17. P. Graunke, R.B. Findler, S. Krishnamurthi, M. Felleisen, Modeling web interactions, in: Proc. of 12th European Symp. on Programming, Lecture Notes in Computer Science, Vol. 2618, 2003, pp. 238-252.
18. J.E. Hanson, P. Nandi, S. Kumaran, Conversation support for business process integration, in: Proc. of Sixth IEEE Internat. Enterprise Distributed Object Computing Conference, 2002.
19. C.A.R. Hoare, Communicating sequential processes, Commun. ACM 21 (8) (1978) 666-677.
20. R. Hull, M. Benedikt, C. Christophides, J. Su, E-services: a look behind the curtain, in: Proc. 22nd ACM Symp. on Principles of Database Systems,2003, pp. 1-14.
21. IBM, Conversation support for agents, e-business, and component integration, http://www.research.ibm.com/convsupport/.
22. G. Kahn, The semantics of a simple language for parallel programming, in: Proc. of IFIP 74,North-Holland, Amsterdam, 1974, pp. 471-475.
23. H. Liu, R.E. Miller, Generalized fair reachability analysis for cyclic protocols, in: IEEE/ACM Transactions on Networking, 1996, pp. 192-204.
24. N. Lynch, M. Tuttle, Hierarchical correctness proofs for distributed algorithms, in: Proc. Sixth ACM Symp. Principles of Distributed Computing, 1987, pp. 137-151.
25. R. Milner, Communicating and Mobile Systems: the π-Calculus, Cambridge University Press, Cambridge, 1999.
26. W. Peng, Single-link and time communicating finite state machines, in: Proc. of Second Internat. Conf. on Network Protocols, 1994, pp. 126-133.
27. A. Pnueli, R. Rosner, On the synthesis of a reactive module, in: Proc. of 16th ACM Symp. Principles of Programming Languages,1989, pp. 179-190.
28. A. Pnueli, R. Rosner, On the synthesis of an asynchronous reactive module, in: Proc. of 16th Internat. Colloq. on Automata, Languages, and Programs, Lecture Notes in Computer Science, Vol. 372, 1989, pp. 652-671.
29. S.K. Rajamani, J. Rehof, A behavioral module system for the pi-calculus, in: Proc. of Static Analysis Symposium (SAS), Lecture Notes in Computer Science, Vol. 2126, 2001, pp. 375-394.
30. Sun, Java Message Service. http://java.sun.com/products/jms/.
31. Web Service Choreography Interface (WSCI) 1.0. http://www.w3.org/TR/2002/ NOTE-wsci-20020808/, August 2002.
32. Web Services Description Language (WSDL) 1.1. http://www.w3.org/TR/wsdl, March 2001.