Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
R. Alur, T. A. Henzinger, O. Kupferman, and M.Y. Vardi. Alternating refinement relations. In CONCUR 98: Concurrency Theory, Lecture Notes in Computer Science 1466, pages 163–178. Springer-Verlag, 1998.
A. Chakrabarti, L. de Alfaro, T.A. Henzinger, M. Jurdziński, and F. Y.C. Mang. Interface compatibility checking for software modules. In CAV 02: Computer-Aided Verification, Lecture Notes in Computer Science 2404, pages 428–441. Springer-Verlag, 2002.
A. Chakrabarti, L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang. Synchronous and bidirectional component interfaces. In CAV 02: Computer-Aided Verification, Lecture Notes in Computer Science 2404, pages 414–427. Springer-Verlag, 2002.
A. Chakrabarti, L. de Alfaro, T.A. Henzinger, and M. Stoelinga. Resource interfaces. Submitted, 2003.
L. de Alfaro and T.A. Henzinger. Interface automata. In Proceedings of the Ninth Annual Symposium on Foundations of Software Engineering, pages 109–120. ACM Press, 2001.
L. de Alfaro and T.A. Henzinger. Interface theories for component-based design. In EMSOFT 01: Embedded Software, Lecture Notes in Computer Science 2211, pages 148–165. Springer-Verlag, 2001.
L. de Alfaro, T.A. Henzinger, and M. Stoelinga. Timed interfaces. In EMSOFT 02: Embedded Software, Lecture Notes in Computer Science 2491, pages 108–122. Springer-Verlag, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Henzinger, T.A. (2003). Automata for Specifying Component Interfaces. In: Ibarra, O.H., Dang, Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45089-0_1
Download citation
DOI: https://doi.org/10.1007/3-540-45089-0_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40561-0
Online ISBN: 978-3-540-45089-4
eBook Packages: Springer Book Archive