Abstract
Recent advances in telecommunication and software technology have motivated the study of components with dynamically changing syntactic interfaces. Formal development methods are traditionally directed towards components with static interfaces. We investigate this short-coming of formal development methods and outline how it can be overcome.
We start by presenting a semantic model for interactive components communicating asynchronously by message passing. On the top of this model we build a simple specification language directed towards components with static interfaces. Then we generalise this language to handle components with dynamic interfaces. We introduce operators for composition and hiding.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Abadi and L. Lamport. An old-fashioned recipe for real-time. ACM Transactions on Programming Languages and Systems, 16: 1543–1571, 1994.
S. Abramsky. Retracing some paths in process algebra. In Proc. CONCUR’96, LNCS 1119, pages 1–17, 1996.
J.R. Abrial. The B Book: Assigning Programs to Meaning. Cambridge University Press, 1996.
G. Agha, I. A. Mason, S. Smith, and C. Talcott. A foundation for actor computation. Journal of Functional Programming, 7: 1–72, 1997.
M. Broy. Functional specification of time sensitive communication systems. ACM Transaction on Software Engineering and Methodology, 2: 1–46, 1993.
M. Broy and K. Stollen. Focus on system development. Book manuscript, June 1998.
K. M. Chandy and J. Misra. Parallel Program Design, A Foundation. Addison-Wesley, 1988.
R. Engelking. General Topology. PWN — Polish Scientific Publishers, 1977.
R. Grosu and K. Stollen. A model for mobile point-to-point data-flow networks without channel sharing. In Proc. AMAST’96, LNCS 1101, pages 504–519, 1996.
R. Grosu and K. Stolen. Specification of dynamic networks. In Proc. NWPT’96, pages 67–76. Universitetet i Oslo, 1997.
L. J. Jagadeesan and R. Jagadeesan. Causality and true concurrency: A data-flow analysis of the pi-calculus. In Proc. AMAST’95, LNCS 936, pages 277–291, 1995.
C. B. Jones. Systematic Software Development Using VDM, Second Edition. Prentice-Hall, 1990.
J. N. Kok. A fully abstract semantics for data flow nets. In Proc. PARLE’87, LNCS 259, pages 351–368, 1987.
L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16: 872–923, 1994.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part I and II. Information and Computation, 100: 1–77, 1992.
D. Park. The “fairness” problem and nondeterministic computing networks. In Proc. 4th Foundations of Computer Science, Mathematical Centre Tracts 159, pages 133–161. Mathematisch Centrum Amsterdam, 1983.
V. A. Saraswat, M. Rinard, and P Panangaden. Semantic foundations of concurrent constraint programming. In Proc. POPL’91, pages 333–352, 1991.
I. Stark. A fully abstract domain model for the 7r-calculus. In Proc. LICS’96, pages 36–42. IEEE Computer Society Press, 1996.
K. Stolen. Using relations on streams to solve the RPC-memory specification problem. In Formal Systems Specification, The RPC-Memory Specification Case Study, LNCS 1169, pages 477–520. 1996.
K. Stolen and M. Fuchs. An exercise in conditional refinement. To appear in Prospects for Hardware Foundations, Springer, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this paper
Cite this paper
Stolen, K. (1999). Specification of Dynamic Reconfiguration in the Context of Input/Output Relations. In: Ciancarini, P., Fantechi, A., Gorrieri, R. (eds) Formal Methods for Open Object-Based Distributed Systems. FMOODS 1999. IFIP — The International Federation for Information Processing, vol 10. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35562-7_20
Download citation
DOI: https://doi.org/10.1007/978-0-387-35562-7_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5266-3
Online ISBN: 978-0-387-35562-7
eBook Packages: Springer Book Archive