Abstract
This paper addresses the study of bisimulation based conformance relations in which input and output actions not presented in the specification are added to the implementation. A new definition, that we called soft conformance, is given. Then, we concentrate on the study of the conditions under which a context preserves the soft conformance relation of two agents. These conditions depend both on the specification and the implementation in the conformance relation and also on the context. Since the addition of extraneous actions to the implementation allows to define malicious contexts that would not preserve the conformance relation, such a characterisation of the family of contexts preserving each individual pair (implementation and specification) in the conformance relation is the best result that can be expected in this direction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S.: Observational equivalence as a testing equivalence. Theoretical Computer Science 53(3), 225–241 (1987)
Bruni, R., de Frutos-Escrig, D., Martí-Oliet, N., Montanari, U.: Bisimilarity congruences for open terms and term graphs via tile logic. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 259–274. Springer, Heidelberg (2000)
Brinksma, E.: A theory for the derivation of tests. In: Protocol Specification, Testing and Verification VIII, pp. 63–74. North-Holland, Amsterdam (1988)
Brower, R.W., Stevens, K.S.: Congruent weak conformance, a partial order among processes. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol. 2529, pp. 34–49. Springer, Heidelberg (2002)
Brinksma, E., Scollo, G., Steenbergen, C.: LOTOS specifications, their implementations and their tests. In: Protocol Specification, Testing and Verification VI, pp. 349–360. North-Holland, Amsterdam (1986)
de Frutos-Escrig, D., Llana-Díaz, L.F., Núñez, M.: Friendly testing as a conformance relation. In: Formal Description Techniques and Protocol Specification, Testing, and Verification FORTE X/ PSTV XVII, pp. 283–298. Chapman and Hall, Boca Raton (1997)
de Frutos-Escrig, D., Llana-Díaz, L.F., Núñez, M.: An invitation to friendly testing. Journal of Computer Science and Technology 13(6), 531–545 (1998)
de Frutos-Escrig, D., López, N., Núñez, M.: Global timed bisimulation: An introduction. In: Formal Methods for Protocol Engineering and Distributed Systems, FORTE XII / PSTV XIX, pp. 401–416. Kluwer Academic Publishers, Dordrecht (1999)
Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Leduc, G.: Conformance relation, associated equivalence, and minimum canonical tester in LOTOS. In: Protocol Specification, Testing and Verification XI, pp. 249–264. North-Holland, Amsterdam (1991)
Leduc, G.: A framework based on implementation relations for implementing LOTOS specifications. Computer Networks and ISDN Systems 25(1), 23–41 (1992)
Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Rensink, A.: Bisimilarity of open terms. Information and Computation 156(1-2), 345–385 (2000)
Stevens, K.S.: Practical Verification and Synthesis of Low Latency Asynchronous Systems. PhD thesis, University of Calgary (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
de Frutos Escrig, D., Rodróguez, C.G. (2005). Preserving Contexts for Soft Conformance Relation. In: Grabowski, J., Nielsen, B. (eds) Formal Approaches to Software Testing. FATES 2004. Lecture Notes in Computer Science, vol 3395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31848-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-31848-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25109-5
Online ISBN: 978-3-540-31848-4
eBook Packages: Computer ScienceComputer Science (R0)