Dependency-Based Action Refinement

Arend  Rensink; Heike Wehrheim

doi:10.1007/BFb0029990

Dependency-Based Action Refinement

Arend Rensink
, Heike Wehrheim

Research output: Contribution to conference › Paper › peer-review

4 Citations (Scopus)

75 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 language	English
Pages	468-477
Number of pages	10
DOIs	https://doi.org/10.1007/BFb0029990
Publication status	Published - 1997
Event	22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997 - Bratislava, Slovakia Duration: 25 Aug 1997 → 29 Aug 1997 Conference number: 22

Conference

Conference	22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997
Abbreviated title	MFCS
Country/Territory	Slovakia
City	Bratislava
Period	25/08/97 → 29/08/97

Keywords

IR-66674
EWI-8316

Access to Document

10.1007/BFb0029990

mfcs1997

Cite this

@conference{e9965dd7a88f49d7b31446b41e84580d,

title = "Dependency-Based Action Refinement",

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.",

keywords = "IR-66674, EWI-8316",

author = "Arend Rensink and Heike Wehrheim",

year = "1997",

doi = "10.1007/BFb0029990",

language = "English",

pages = "468--477",

note = "22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997, MFCS ; Conference date: 25-08-1997 Through 29-08-1997",

}

TY - CONF

T1 - Dependency-Based Action Refinement

AU - Rensink, Arend

AU - Wehrheim, Heike

N1 - Conference code: 22

PY - 1997

Y1 - 1997

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

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

KW - IR-66674

KW - EWI-8316

U2 - 10.1007/BFb0029990

DO - 10.1007/BFb0029990

M3 - Paper

SP - 468

EP - 477

T2 - 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997

Y2 - 25 August 1997 through 29 August 1997

ER -

Dependency-Based Action Refinement

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this