Back to University of Twente portal
Dependency-Based Action Refinement
Rensink, A. and Wehrheim, H. (1997) Dependency-Based Action Refinement. In: Mathematical Foundations of Computer Science (MFCS).
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 788Kb |
| Abstract: | Action refinement in process algebras has been widely studied in the last few years as a means to support top-down design of systems. A specific notion of refinement arises when a dependency relation on the actions (in the Mazurkiewicz sense) is used to control the inheritance of orderings from the abstract level. In this paper we present a rather simple operational semantics for dependency-based action refinement. We show the consistency of the operational with a (previously published) denotational semantics. We moreover show that bisimulation is a congruence for dependency-based refinement. Finally, we give an illustrative example. |
| Item Type: | Conference or Workshop Item |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/66674 |
| Official URL: | http://dx.doi.org/10.1007/BFb0029990 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page