Small logs for transactional services: Distinction is much more accurate than (Positive) discrimination

Proceedings of IEEE International Symposium on High Assurance Systems Engineering

Volumn , Issue , 2008, Pages 97-106

  Biswas, Debmalya ^a   Genest, Blaise ^a   Gazagnaire, Thomas ^b  

^a CNRS   (France)

^b Citrix Systems Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HARVESTING; LOGGING (FORESTRY); MIDDLEWARE; SYSTEMS ENGINEERING;

COMPLEX SERVICES; FAST ALGORITHMS; FINITE-STATE-MACHINES (FSM); INTEGRAL PART;

SAFETY ENGINEERING;

EID: 58449108614     PISSN: 15302059     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HASE.2008.24     Document Type: Conference Paper

References (15)

1. G. Alonso, F. Casati, and H. Kuno. Web Services: Concepts, Architecture and Applications. Springer, ISBN: 3540440089, 2004.
2. R. Alur and M. Yannakakis. Model checking of hierarchical state machines. A CM Transactions on Programming Languages and Systems (TOPLAS), 23(3), pages 1-31, 2001.
3. P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, ISBN: 0201107155, 1987.
4. D. Biswas. Compensation in the world of web services composition. In proceedings of the International Workshop on Semantic Web Services and Web Process Composition (SWSWPC), LNCS 3387, pages 69-80, 2004.
5. th International Conference on Software Engineering and Knowledge Engineering (SEKE), pages 531-536, 2008.
6. C. Godsil and G. Royle. Algebraic Graph Theory. Springer, ISBN: 0387952209, 2001.
7. R. Kumar and V. K. Garg. Modeling and Control of Logical Discrete Event Systems. Springer, ISBN: 0792395387, 1994.
8. F. Lin and W. M. Wonham. On observability of discrete-event systems. Information Sciences, 44(3), pages 173-198, 1988.
9. S. Maheshwari. Traversal marker placement problems are np-complete. Boulder University Research Report CU-CS-092-76, 1976.
10. C. M. Özveren and A. S. Wilsky. Observability of discrete event dynamical systems. IEEE Transactions on Automatic Control, 35(7), pages 797-806, 1990.
11. K. Rohloff, S. Khuller, and G. Kortsarz. Approximating the minimal sensor selection for supervisory control. Discrete Event Dynamic Systems, 16(1), pages 143-170, 2006.
12. W. Sadiq and M. E. Orlowska. Analyzing process models using graph reduction techniques. Information Systems, 25(2), pages 117-134, 2000.
13. M. Sampath, R. Sengupta, S. Lafortune, K. Sinaamohideen, and D. Teneketzis. Diagnosability of discrete event system-s. IEEE Transactions on Automatic Control, 40(9), pages 1555-1575, 1995.
14. A. Wombacher, P. Fankhauser, and E. Neuhold. Transforming bpel into annotated deterministic finite state automata for service discovery. In proceedings of the IEEE International Conference on Web Services (ICWS), pages 316-323, 2004.
15. T.-S. Yoo and S. Lafortune. Np-completeness of sensor selection problems arising in partially-observed discrete-event systems. IEEE Transactions on Automatic Control, 47(9), pages 1495-1499, 2002.