In this paper, we present a durational process algebra incorporating syntactic action refinement. We study its correctness with respect to the semantic refinement in an interleaving model, namely the labelled transition systems. This defined refinement is compositional over the language operators and may provide at a given level of abstraction a timed efficient implementation for a specification.
Author and article information
CRIN/INRIA, Université Henri Poicaré
Nancy, 54500, France.