Testing systems specified as partial order input/output automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5047 LNCS, Issue , 2008, Pages 169-183

  Bochmann, Gregor V ^a   Haar, Stefan ^b   Jard, Claude ^c   Jourdan, Guy Vincent ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

^b CAMPUS DE BEAULIEU   (France)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Conformance relations; Finite state automata; HMSC; Partial order; Partial order automata; Testing distributed systems

Indexed keywords

AUTOMATA THEORY; FINITE AUTOMATA; SET THEORY; SPECIFICATIONS;

CONFORMANCE RELATIONS; DISTRIBUTED SYSTEMS; FORMAL DEFINITION; HMSC; INPUT/OUTPUT AUTOMATA; PARTIAL ORDER; PARTIALLY ORDERED SET; SYSTEM SPECIFICATION;

SOFTWARE TESTING;

EID: 84871224908     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68524-1_13     Document Type: Conference Paper

References (13)

1. Haar, S., Jard, C., Jourdan, G.V.: Testing Input/Output Partial Order Automata. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds.) TestCom/FATES 2007. LNCS, vol. 4581, pp. 171-185. Springer, Heidelberg (2007)
2. Lynch, N.A., Tuttle, M.R.: An introduction to input/output automata. CWI Quarterly 2(3), 219-246 (1989)
3. Mauw, S., Reniers, M.: High-level Message Sequence Charts. In: Cavalli, A., Sarma, A. (eds.) Proceedings of the Eight SDL Forum, SDL 1997. Time for Testing -SDL MSC and Trends, Evry, France, September 23-26, 1997, pp. 291-306 (1997)
4. Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. Theor. Comput. Sci. 331(1), 97-114 (2005)
5. Mooij, A., Romijn, J., Wesselink, W.: Realizability criteria for compositional MSC. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, Springer, Heidelberg (2006)
6. Mooij, A.J., Goga, N., Romijn, J.: Non-local choice and beyond: Intricacies of MSC choice nodes. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, Springer, Heidelberg (2005)
7. Castejón, H.N., Bræk, R., Bochmann, G.V.: Realizability of Collaboration-based Service Specification. In: APSEC conference (November 2007)
8. Abadi, M., Lamport, L.: Conjoining specifications. ACM Transactions on Programming Languages & Systems 17(3), 507-534 (1995)
9. Bochmann, G.v.: Submodule construction for specifications with input assumptions and output guarantees. In: FORTE 2002, Chapman & Hall, Boca Raton (2002)
10. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics (51), 161-166 (1950)
11. Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines -a survey. Proceedings of the IEEE 84(8), 1089-1123 (1996)
12. Gouda, M.G., Yu, Y.-T.: Synthesis of communicating Finite State Machines with guaranteed progress. IEEE Trans on Communications Com-32(7), 779-788 (1984)
13. Luo, G., Dssouli, R., Bochmann, G.v., Ventakaram, P., Ghedamsi, A.: Generating synchronizable test sequences based on finite state machines with distributed ports. In: Proceedings of the IFIP Sixth International Workshop on Protocol Test Systems, Pau, France, September 1993, pp. 53-68 (1993)