Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

MFCS
1997
Springer

favoriteEmaildiscussreport

88views Theoretical Computer Science» more MFCS 1997»

Dependency-Based Action Refinement

13 years 8 months ago

Dependency-Based Action Refinement

Download wwwhome.cs.utwente.nl

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 inherf 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.

Arend Rensink, Heike Wehrheim

Real-time Traffic

Action Refinement | Dependency-based Action Refinement | MFCS 1997 | Refinement Arises | Theoretical Computer Science |

claim paper

Related Content

» Changing System Interfaces Consistently A New Refinement Strategy for CSPB

» A Pattern and Dependency Based Approach to the Design of Process Models

» Can Refinement be Automated

» A Foundation for Refining Concurrent Objects

» Refining the Execution of Abstract Actions with Learned Action Models

» Action Refinement in Reinforcement Learning by Probability Smoothing

» Possibilistic Information Flow Control in MAKS and Action Refinement

» Action Refinement Applied to Late Decisions

» On the Refinement of Atomic Actions

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1997
Where	MFCS
Authors	Arend Rensink, Heike Wehrheim

Comments (0)