Skip to main content
SpringerLink
Log in

Towards a Theory of Refinement in Timed Coordination Languages

  • Conference paper
Coordination Models and Languages (COORDINATION 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4467))

Included in the following conference series:

  • 303 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, M., de Alfaro, L. (eds.): CONCUR 2005. LNCS, vol. 3653. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  2. Abrial, J.-R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)

    MATH  Google Scholar 

  3. Baier, C., Hermanns, H. (eds.): CONCUR 2006. LNCS, vol. 4137. Springer, Heidelberg (2006)

    Google Scholar 

  4. Ball, T., Jones, R.B. (eds.): CAV 2006. LNCS, vol. 4144. Springer, Heidelberg (2006)

    Google Scholar 

  5. Berry, G., Gonthier, G.: The Esterel Synchronous Programming Language: Design, Semantics, Implementation. Science of Computer Programming, 19 (1992)

    Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. 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)

    MathSciNet  Google Scholar 

  8. Carriero, N., Gelernter, D.: Linda in Context. Communications of the ACM 32(4), 444–458 (1989)

    Article  Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Article  Google Scholar 

  11. de Bakker, J., de Vink, E.: Control Flow Semantics. MIT Press, Cambridge (1996)

    MATH  Google Scholar 

  12. Etessami, K., Rajamani, S.K. (eds.): CAV 2005. LNCS, vol. 3576. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  13. Freeman, E., Hupfer, S., Arnold, K.: JavaSpaces: Principles, Patterns, and Practice. Addison-Wesley, Reading (1999)

    Google Scholar 

  14. Gelernter, D., Carriero, N.: Coordination Languages and Their Significance. Communications of the ACM 35(2), 97–107 (1992)

    Article  Google Scholar 

  15. Harel, D.: Statecharts: a Visual Formalism for Complex Systems. Science of Computer Programming, 8 (1987)

    Google Scholar 

  16. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  17. 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)

    Google Scholar 

  18. Johansson, K.H., Egerstedt, M., Lygeros, J., Sastry, S.: On the Regularisation of Zeno Hybrid Automata. System and Control Letters 38, 141–150 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  19. 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)

    Google Scholar 

  20. 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)

    Article  Google Scholar 

  21. 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)

    Article  MATH  MathSciNet  Google Scholar 

  22. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    Google Scholar 

  23. Milner, R.: Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  24. Omicini, A., Zambonelli, F., Klusch, M., Tolksdorf, R. (eds.): Coordination of Internet Agents: Models, Technologies, and Applications. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  25. Papadopolous, G.A., Arbab, F.: Coordination Models and Languages. Advances in Computers, 48 (1998)

    Google Scholar 

  26. Roscoe, A.W.: Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)

    Google Scholar 

  27. Schneider, S.: Concurrent and Real-time Systems: the CSP Approach. John Wiley & Sons, Chichester (2000)

    Google Scholar 

  28. Semini, L., Montangero, C.: A Refinement Calculus for Tuple Spaces. Science of Computer Programming 34(2), 79–140 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  29. Wyckoff, P.: T Spaces. IBM Systems Journal, 37(3) (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, FUNDP – University of Namur,  

    Jean-Marie Jacquet & Isabelle Linden

Authors
  1. Jean-Marie Jacquet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Isabelle Linden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Amy L. Murphy Jan Vitek

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation