Abstract
We propose a theory of process refinement which relates behavioural descriptions belonging to conceptually different abstraction levels, through a so-called vertical implementation relation. The theory is based on action refinement, which permits to relate abstract actions of the implementation to concrete computations of the implementation; it is developed in the standard interleaving approach. A number of proof rules is shown to be sound for the particular vertical implementation relation (based on observation congruence) we study in this paper. We give an illustrative example.
This work has been partially supported by the Vigoni exchange program and the HCM network EXPRESS (“Expressiveness of Languages for Concurrency”).
Chapter PDF
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
L. Aceto and M. Hennessy. Termination, deadlock, and divergence. J. ACM, 39(1):147–187, Jan. 1992.
L. Aceto and M. Hennessy. Towards action-refinement in process algebras. I&C 103:204–269, 1993.
L. Aceto and M. Hennessy. Adding action refinement to a finite process algebra I&C, 115:179–247, 1994.
E. Brinksma, B. Jonsson, and F. Orava. Refining interfaces of communicating systems. In Abramsky and Maibaum, eds., TAPSOFT '91, Volume 2, vol. 494 of LNCS, pp. 297–312. Springer, 1991.
L. Castellano, G. De Michelis, and L. Pomello. Concurrency vs. interleaving: An instructive example. Bull. EATCS, 31:12–15, 1987.
I. Czaja, R. J. van Glabbeek, and U. Goltz. Interleaving semantics and action refinement with atomic choice. In Rozenberg, ed., Advances in Petri Nets 1992, vol. 609 of LNCS, pp. 89–109. Springer, 1992.
P. Degano and R. Gorrieri. A causal operational semantics of action refinement. I&C, 122:97–119, 1995.
P. Degano, R. Gorrieri, and G. Rosolini. A categorical view of process refinement. In De Bakker, De Roever, and Rozenberg, eds., Semantics: Foundations and Applications, vol. 666 of LNCS, pp. 138–153. Springer, 1992.
R. J. van Glabbeek. The linear time — branching time spectrum II: The semantics of sequential systems with silent moves. In Best, ed., Concur '93, vol. 715 of LNCS, pp. 66–81. Springer, 1993.
R. J. van Glabbeek and U. Goltz. Refinement of actions in causality based models. In De Bakker, De Roever, and Rozenberg, eds., Stepwise Refinement of Distributed Systems — Models, Formalisms, Correctness, vol. 430 of LNCS, pp. 267–300. Springer, 1990.
U. Goltz, R. Gorrieri, and A. Rensink. Comparing syntactic and semantic action refinement. I&C, 125(2):118–143, Mar. 1996.
R. Gorrieri. A hierarchy of system descriptions via atomic linear refinement. Fund. Informaticae, 16:289–336, 1992.
M. Huhn. Action refinement and property inheritance in systems of sequential agents. In Montanari and Sassone, eds., Concur '96: Concurrency Theory, vol. 1119 of LNCS, pp. 639–654. Springer, 1996.
W. Janssen, M. Poel, and J. Zwiers. Actions systems and action refinement in the development of parallel systems. In Baeten and Groote, eds., Concur '91, vol. 527 of LNCS, pp. 298–316. Springer, 1991.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
M. Nielsen, U. Engberg, and K. G. Larsen. Fully abstract models for a process language with refinement. In De Bakker, De Roever, and Rozenberg, eds., Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, vol. 354 of LNCS, pp. 523–549. Springer, 1989.
A. Rensink. Methodological aspects of action refinement. In Olderog, ed., Programming Concepts, Methods and Calculi, pp. 227–246. IFIP, 1994.
A. Rensink. An event-based SOS for a language with refinement. In Desel, ed., Structures in Concurrency Theory, pp. 294–309. Springer, 1995.
W. Vogler. Failures semantics based on interval semiwords is a congruence for refinement. Distributed Computing, 4:139–162, 1991.
W. Vogler. Bisimulation and action refinement. TCS, 114:173–200, 1993.
H. Wehrheim. Parametric action refinement. In Olderog, ed., Programming Concepts, Methods and Calculi, pp. 247–266. IFIP, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rensink, A., Gorrieri, R. (1997). Action refinement as an implementation relation. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030640
Download citation
DOI: https://doi.org/10.1007/BFb0030640
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive