Abstract
Interface automata is a formal model to be used for describing the temporal interface behaviors of software components. It adopts an alternating approach to design refinement, which is significantly different with the traditional use of automata. In this paper, it is proven that an interface automaton refines another if and only if there exists a special kind of forward simulation between their corresponding I/O automata, which shows the essential relation between interface automata and I/O automata on refinements.
Supported by National Natural Science Foundation of China under the grants 60233020, 90104007, and 60303013, and by the National Hi-Tech Programme of China under the grant 2001AA113202.
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
de Alfaro, L., Henzinger, T.A.: Interface automata. In: 9th Symposium on Foundations of Software Engineering. ACM Press, New York (2001)
Jin, Y., Esser, R., Lakos, C., Janneck, J.W.: Modular analysis of dataflow process networks. In: Pezzé, M. (ed.) FASE 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS’03). LNCS, vol. 2621, pp. 184–199. Springer, Heidelberg (2003)
Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Jurdziński, M., Mang, F.Y.C.: Interface compatibility checking for software modules. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, p. 428. Springer, Heidelberg (2002)
Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Mang, F.Y.: Synchronous and bidirectional component interfaces. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 414–427. Springer, Heidelberg (2002)
Lee, E.A., Xiong, Y.: Behavioral types for component-based design. In: Memorandum UCB/ERL M02/29, University of California, Berkeley, CA 94720, USA (2002)
de Alfaro, L., Henzinger, T.A.: Interface theories for component-based design. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, pp. 148–165. Springer, Heidelberg (2001)
Lynch, N., Tuttle, M.: An introduction to input/output automata. CWI Quarterly 2, 219–246 (1989)
Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM (JACM) 31, 560–599 (1984)
Lynch, N., Vaandrager, F.: Forward and backward simulations part 1: Untimed systems. Information and Computation 121, 214–233 (1995)
Garland, S.J., Lynch, N.A.: The IOA language and toolset: Support for mathematics-based distributed programming. Technical Report MIT-LCS-TR-762, Laboratory of Computer Science, Massachusetts Institute of Technology, Cambridge, MA (1998)
Bogdanov, A.: Formal verification of simulations between I/O automata. Master’s thesis, Massachusetts Institute of Technology (2001)
Guttag, J.V., Horning, J.J., Modet, A.: Report on the larch shared language: Version 2.3. Technical Report Technical Report 58, Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301 (1990)
Mueller, O.: A Verification Environment for I/O Automata Based on Formalized Meta-Theory. PhD thesis, Technische Universitaet Muenchen (1998)
Cheung, S.C., Kramer, J.: Checking subsystem safety properties in compositional reachability analysis. In: Proceedings of the 18th international conference on Software engineering, Berlin, Germany, pp. 144–154 (1996)
Cheung, S.C., Kramer, J.: Compositional reachability analysis of finite-state distributed systems with user-specified constraints. In: Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering, United States, Washington, D.C. pp. 140–150 (1995)
Graf, S., Steffen, B., Lüttgen, G.: Compositional minimization of finite state systems using interface specifications. Technical Report MIP-9505, Universität Passau, Passau, Germany (1995)
Schellhorn, G.: Verification of ASM refinements using generalized forward simulation. Journal of Universal Computer Science 7, 952–979 (2001)
Garland, S.J., Lynch, N.A., Vaziri, M.: IOA: a language for specifying, programming, and validating distributed systems. MIT Laboratory for Computer Science (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wen, Y., Wang, J., Qi, Z. (2004). Bridging Refinement of Interface Automata to Forward Simulation of I/O Automata. In: Davies, J., Schulte, W., Barnett, M. (eds) Formal Methods and Software Engineering. ICFEM 2004. Lecture Notes in Computer Science, vol 3308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30482-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-30482-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23841-6
Online ISBN: 978-3-540-30482-1
eBook Packages: Springer Book Archive