Abstract
Building upon previous work on timed coordination languages, this paper presents a novel notion of refinement for these languages which satisfies the substitutability property: if the implementation I refines the specification S and if C[S] is deadlock free, for some context C, then C[I] is also deadlock free.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abadi, M., de Alfaro, L. (eds.): CONCUR 2005. LNCS, vol. 3653. Springer, Heidelberg (2005)
Abrial, J.-R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)
Baier, C., Hermanns, H. (eds.): CONCUR 2006. LNCS, vol. 4137. Springer, Heidelberg (2006)
Ball, T., Jones, R.B. (eds.): CAV 2006. LNCS, vol. 4144. Springer, Heidelberg (2006)
Berry, G., Gonthier, G.: The Esterel Synchronous Programming Language: Design, Semantics, Implementation. Science of Computer Programming, 19 (1992)
Brogi, A., Jacquet, J.-M.: Modeling Coordination via Asynchronous Communication. In: Garlan, D., Le Métayer, D. (eds.) COORDINATION 1997. LNCS, vol. 1282, pp. 238–255. Springer, Heidelberg (1997)
Brogi, A., Jacquet, J.-M., Linden, I.: Fully Abstract Semantics for a Coordination Model with Asynchronous Communication and Enhanced Matching. Fundamenta Informaticae 73(4), 431–478 (2006)
Carriero, N., Gelernter, D.: Linda in Context. Communications of the ACM 32(4), 444–458 (1989)
Caspi, P., Halbwachs, N., Pilaud, P., Plaice, J.: Lustre: a Declarative Language for Programming Synchronous Systems. In: Proc. POPL’87, ACM Press, New York (1987)
Cleaveland, R., Parrow, J., Steffen, B.: The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems 15(1), 36–72 (1993)
de Bakker, J., de Vink, E.: Control Flow Semantics. MIT Press, Cambridge (1996)
Etessami, K., Rajamani, S.K. (eds.): CAV 2005. LNCS, vol. 3576. Springer, Heidelberg (2005)
Freeman, E., Hupfer, S., Arnold, K.: JavaSpaces: Principles, Patterns, and Practice. Addison-Wesley, Reading (1999)
Gelernter, D., Carriero, N.: Coordination Languages and Their Significance. Communications of the ACM 35(2), 97–107 (1992)
Harel, D.: Statecharts: a Visual Formalism for Complex Systems. Science of Computer Programming, 8 (1987)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Jacquet, J.-M., De Bosschere, K., Brogi, A.: On Timed Coordination Languages. In: Porto, A., Roman, G.-C. (eds.) COORDINATION 2000. LNCS, vol. 1906, pp. 81–98. Springer, Heidelberg (2000)
Johansson, K.H., Egerstedt, M., Lygeros, J., Sastry, S.: On the Regularisation of Zeno Hybrid Automata. System and Control Letters 38, 141–150 (1999)
Linden, I., Jacquet, J.-M.: On the Expressiveness of Absolute-Time Coordination Languages. In: De Nicola, R., Ferrari, G.L., Meredith, G. (eds.) COORDINATION 2004. LNCS, vol. 2949, pp. 232–247. Springer, Heidelberg (2004)
Linden, I., Jacquet, J.-M., De Bosschere, K., Brogi, A.: On the Expressiveness of Relative-Timed Coordination Models. Electronical Notes in Theoretical Computer Science 97, 125–153 (2004)
Linden, I., Jacquet, J.-M., De Bosschere, K., Brogi, A.: On the Expressiveness of Timed Coordination Models. Science of Computer Programming 61(2), 152–187 (2006)
Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Milner, R.: Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, Cambridge (1999)
Omicini, A., Zambonelli, F., Klusch, M., Tolksdorf, R. (eds.): Coordination of Internet Agents: Models, Technologies, and Applications. Springer, Heidelberg (2001)
Papadopolous, G.A., Arbab, F.: Coordination Models and Languages. Advances in Computers, 48 (1998)
Roscoe, A.W.: Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)
Schneider, S.: Concurrent and Real-time Systems: the CSP Approach. John Wiley & Sons, Chichester (2000)
Semini, L., Montangero, C.: A Refinement Calculus for Tuple Spaces. Science of Computer Programming 34(2), 79–140 (1999)
Wyckoff, P.: T Spaces. IBM Systems Journal, 37(3) (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Jacquet, JM., Linden, I. (2007). Towards a Theory of Refinement in Timed Coordination Languages. In: Murphy, A.L., Vitek, J. (eds) Coordination Models and Languages. COORDINATION 2007. Lecture Notes in Computer Science, vol 4467. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72794-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-72794-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72793-4
Online ISBN: 978-3-540-72794-1
eBook Packages: Computer ScienceComputer Science (R0)