Minimal observability for transactional hierarchical services

20th International Conference on Software Engineering and Knowledge Engineering, SEKE 2008

Volumn , Issue , 2008, Pages 531-536

  Biswas, Debmalya ^a   Genest, Blaise ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX SERVICES; DECOMPOSITION MECHANISM; EXPONENTIALS; HETEROGENEOUS SERVICES; INTEGRAL PART; NP COMPLETE;

DECOMPOSITION; KNOWLEDGE ENGINEERING; MIDDLEWARE;

SOFTWARE ENGINEERING;

EID: 67349163395     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. G. Alonso, F. Casati, H. Kuno, and V. Machiraju. Web Services: Concepts, Architecture and Applications. Springer Verlag, ISBN: 3540440089, 2004.
2. R. Alur and M. Yannakakis. Model checking of hierarchical state machines. ACM TOPLAS, 23(3), pages 1-31, 2001.
3. D. Biswas. Compensation in the world of web services composition. In SWSWPC, pages 69-80, 2004.
4. D. Biswas and B. Genest. Minimal observability for transactional hierarchical services. available at http://www.crans.org/̃genest/BG08.pdf.
5. R. Kumar and V. Garg. Modeling and control of logical discrete event systems. Kluwer Academic, 1995.
6. F. Lin and W. Wonham. On observability of discrete-event systems. Information Sciences, 44(3), pages 173-198, 1988.
7. M. Lohrey and S. Manneth. The complexity of tree automata and xpath on grammar-compressed trees. Theoretical Computer Science, 363(2), pages 196-210, 2006.
8. S. Maheshwari. Traversal marker placement problems are np-complete. Boulder Univ. Report CU-CS-092-76, 1976.
9. C. Ozveren and A. Wilsky. Observability of discrete event dynamical systems. IEEE Trans. Auto. Control, 35(7), pages 797-806, 1990.
10. W. Plandowski and W. Rytter. Complexity of language recognition problems for compressed words. In Jewels are Forever, Springer, pages 262-272, 1999.
11. K. Rohloff and J. Schuppen. Approximating the minimal cost sensor selection for discrete-event systems. JDEDS, 16(1), pages 143-170, 2006.
12. W. Sadiq and M. Orlowska. Analyzing process models using graph reduction techniques. Inf. Syst., 25(2), pages 117-134, 2000.
13. M. Sampath, R. Sengupta, S. Lafortune, K. Sinaamohideen, and D. Teneketzis. Diagnosability of discrete event systems. IEEE Trans. Auto. Control, 40(9), pages 1555-1575, 1995.
14. G. Weikum, A. Deacon, W. Schaad, and S. H. Open nested transactions in federated database systems. IEEE Data Engg. Bulletin, 16(2), pages 4-7, 1993.
15. A. Wombacher, P. Fankhauser, and E. Neuhold. Transforming bpel into annotated deterministic finite state automata for service discovery. In ICWS, pages 316-323, 2004.
16. Web services transactions specifications. http://msdn2.microsoft.com/en- us/library/ms951262.aspx.
17. T. Yoo and S. Lafortune. Np-completeness of sensor selection problems arising in partially observed discrete-event systems. IEEE Trans. Auto. Control, 35(7), pages 797-806, 1990.