Abstract
An Input/Output Automaton is an automaton with a finite number of states where each transition is associated with a single inpuf or output interaction. In [1], we introduced a new formalism, in which each transition is associated with a bipartite partially ordered set made of concurrent inputs followed by concurrent outputs. In this paper, we generalize this model to Partial Order Input/Output Automata (POIOA), in which each transition is associated with an almost arbitrary partially ordered set of inputs and outputs. This formalism can be seen as High-Level Messages Sequence Charts with inputs and outputs and allows for the specification of concurrency between inputs and outputs in a very general, direct and concise way. We give a formal definition of this framework, and define several conformance relations for comparing system specifications expressed in this formalism. Then we show how to derive a test suite that guarantees to detect faults defined by a POIOA-specific fault model: missing output faults, unspecified output faults, weaker precondition faults, stronger precondition faults and transfer faults.
Chapter PDF
Similar content being viewed by others
Keywords
References
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)
Lynch, N.A., Tuttle, M.R.: An introduction to input/output automata. CWI Quarterly 2(3), 219–246 (1989)
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)
Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. Theor. Comput. Sci. 331(1), 97–114 (2005)
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)
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)
Castejón, H.N., Bræk, R., Bochmann, G.V.: Realizability of Collaboration-based Service Specification. In: APSEC conference (November 2007)
Abadi, M., Lamport, L.: Conjoining specifications. ACM Transactions on Programming Languages & Systems 17(3), 507–534 (1995)
Bochmann, G.v.: Submodule construction for specifications with input assumptions and output guarantees. In: FORTE 2002, Chapman & Hall, Boca Raton (2002)
Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics (51), 161–166 (1950)
Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines – a survey. Proceedings of the IEEE 84(8), 1089–1123 (1996)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bochmann, G.v., Haar, S., Jard, C., Jourdan, GV. (2008). Testing Systems Specified as Partial Order Input/Output Automata. In: Suzuki, K., Higashino, T., Ulrich, A., Hasegawa, T. (eds) Testing of Software and Communicating Systems. FATES TestCom 2008 2008. Lecture Notes in Computer Science, vol 5047. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68524-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-68524-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68514-2
Online ISBN: 978-3-540-68524-1
eBook Packages: Computer ScienceComputer Science (R0)