Timed modeling of Web services composition for automatic testing

Proceedings - International Conference on Signal Image Technologies and Internet Based Systems, SITIS 2007

Volumn , Issue , 2007, Pages 417-426

  Lallali, Mounir ^a   Zaidit, Fatiha ^b,c   Cavalli, Ana ^a  

^a INSTITUT TELECOM   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS BEHAVIORS; COMPLEX SYSTEMS; DATA VARIABLES; FINITE STATE MACHINES; FORMAL MAPPINGS; GLOBAL VARIABLES; RIGOROUS APPROACHES; TIMING CONSTRAINTS; WEB SERVICES COMPOSITIONS;

AUTOMATIC TESTING; COMPUTER PROGRAMMING LANGUAGES; INTERNET; TIMING CIRCUITS; WEB SERVICES;

WORLD WIDE WEB;

EID: 57849122051     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SITIS.2007.110     Document Type: Conference Paper

References (23)

1. R. Alur and D. L. Dill. A Theory of Timed Automata. Theor. Comput. Set., 126(2): 183-235, 1994.
2. E. Bayse, A. Cavalli, M. Núñez, and F. Zaïdi. A Passive Testing Approach based on Invariants: Application to the WAP. Computer Network, 48(2):247-266, 2005.
3. J. Bengtsson and W. Yi. Timed Automata: Semantics, Algorithms and Tools. In Lecture Notes on Concurrency and Petri Nets, W. Reisig and G. Rozenberg (eds.), LNCS 3098, Springer-Verlag, 2004.
4. T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Comput. Netw. ISDN Syst., 14(1):25-59, 1987.
5. M. Bravetti, M. Núñez, and G. Zavattaro, editors. Web Services and Formal Methods, Third International Workshop, WS-FM2006 Vienna, Austria, Sep 8-9, 2006, Proceedings, volume 4184 of Lecture Notes in Computer Science. Springer, 2006.
6. A. Cavalli, D. Lee, C. Rinderknecht, and F. Zaidi. Hit-or-Jump: An Algorithm for Embedded Testing with Applications to IN Services. In Proceedings of FORTE/PSTV'99, Beijing, China, 1999.
7. K. Chen, J. Sztipanovits, and S. Abdelwahed. A Semantic Unit for Timed Automata Based Modeling Languages. In Proceedings of RTAS'06, pages 347-360. IEEE Computer Society, 2006.
8. A. David, K. G. Larsen, J. Håkansson, and P. Pettersson. Model Checking Timed Automata with Priorities using DBM Subtraction. In FORMATS'06, pages 128-142, Sep. 2006.
9. J. G. Fanjul, J. Tuya, and C. de la Riva. Generating Test Cases Specifications for Compositions of Web Services using SPIN. In Proceedings ofWS-MaTe2006 Workshop, pages 83-94, 2006.
10. H. Foster, S. Uchitel, J. Magee, and J. Kramer. Model-based verification of web service compositions, ase, 00:152, 2003.
11. G. J. Holzmann. The SPIN Model Checker: Primer and Reference Manual., 2003.
12. IF toolset, http://www-if.imag.fr/index.html.
13. R. Kazhamiakin, P. Pandya, and M. Pistore. Timed modelling and analysis in web service compositions, ares, Volume 0:840-846, 2006.
14. M. Lallali, F. Zaidi, and A. Cavalli. Timed Modeling of Web Services Composition for Automatic Testing, full version, Sep. 2007. http://www.lri.fr/ ̃zaidi/publications/.
15. Maurice, A. Bucciaroneand, and S. Gnesi. A Survey on Service Composition Approaches: From Industrial Standards to Formal Methods. Technical Report 2006-TR-15, Consiglio Nazionale delle Ricerche, 2006.
16. M. G. Merayo, M. Núñez, and I. Rodríguez. Generation of Optimal Finite Test Suites for Timed Systems. In TASE, pages 149-158, 2007.
17. S. NAKAJIMA. Lightweight formal analysis of web service flows. Progress in Informatics, Volume 2:57-76, 2005.
18. OASIS. WSBPEL (Version 2.0), April 2007. http://docs.oasis-open.org/ wsbpel/2.0/wsbpel-v2.0.html.
19. M. Pistore, P. Traverso, P. Bertoli, and A. Marconi. Automated Synthesis of Composite BPEL4WS Web Services. In Proceedings of ICWS'05, pages 293-301. IEEE Computer Society, 2005.
20. C. Stahl. A Petri Net Semantics for BPEL. http://www2.informatik.hu- berlin.de/Institut/struktur/systemanalyse/preprint/stahl188.pdf.
21. UPPAAL. http://www.uppaal.com/.
22. F. van Breugell and M. Koshkina. Models and Verification of BPEL. http://www.cse.yorku.ca/̃franck/research/drafts/tutorial.pdf.
23. A. Wombacher, P. Fankhauser, and E. Neuhold. Transforming BPEL into Annotated Deterministic Finite State Automata for Service Discovery. In Proceedings of ICWS'04, page 316. IEEE Computer Society, 2004.