Loading...
Please wait, while we are loading the content...
Similar Documents
Dependency-Based Action Refinement (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Rensink, Arend Wehrheim, Heike |
| Description | Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS'97 . 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. 1 Introduction Action refinement in process algebras [1, 2, 18, 11, 8, 9] has been proposed to support hierarchical design of reactive systems. Starting with an abstract specification, step-by-step more concrete specifications are constructed by refining actions into concrete processes. Thus the complexity of the design process is reduced and furthermo... |
| File Format | |
| Language | English |
| Publisher | Springer |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Concrete Process Dependency-based Refinement Refinement Arises Dependency-based Action Refinement Concrete Specification Top-down Design Illustrative Example Introduction Action Refinement Abstract Specification Dependency Relation Design Process Hierarchical Design Denotational Semantics Simple Operational Semantics Last Year Abstract Level Process Algebra Action Refinement Specific Notion Reactive System Mazurkiewicz Sense |
| Content Type | Text |
| Resource Type | Article |