Dependency-Based Action Refinement

Arend Rensink, Heike Wehrheim

    Research output: Contribution to conferencePaperAcademicpeer-review

    4 Citations (Scopus)
    13 Downloads (Pure)

    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.
    Original languageEnglish
    Pages468-477
    Number of pages10
    DOIs
    Publication statusPublished - 1997
    Event22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997 - Bratislava, Slovakia
    Duration: 25 Aug 199729 Aug 1997
    Conference number: 22

    Conference

    Conference22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997
    Abbreviated titleMFCS
    CountrySlovakia
    CityBratislava
    Period25/08/9729/08/97

    Keywords

    • IR-66674
    • EWI-8316

    Fingerprint Dive into the research topics of 'Dependency-Based Action Refinement'. Together they form a unique fingerprint.

    Cite this