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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Jacquet, J. M., & Linden, I. (2007). Towards a theory of refinement in timed coordination languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4467 LNCS, pp. 113–131). Springer Verlag. https://doi.org/10.1007/978-3-540-72794-1_7
Mendeley helps you to discover research relevant for your work.