Add to ORKGAbstract. Action renement in process algebras has been widely stud-ied in the last few years as a means to support top-down design of sys-tems. A specic notion of renement arises when a dependency relation on the actions (in the Mazurkiewicz sense) is used to control the inher-itance of orderings from the abstract level. In this paper we present a rather simple operational semantics for dependency-based action rene-ment. We show the consistency of the operational with a (previously published) denotational semantics. We moreover show that bisimulation is a congruence for dependency-based renement. Finally, we give an illustrative example.
For a process language with action refinement and synchronization both an operational and a denotati...
Action refinement is an essential operation in the design of concurrent systems, real-time or not. I...
AbstractRefinement of actions allows one to design systems in a top-down style, changing the level o...
Action refinement in process algebras has been widely studied in the last few years as a means to su...
In this paper, we present a process algebra with a minimal form of semantics for actions given by de...
Abstract. In this paper, we present a process algebra with a minimal form of semantics for actions g...
Abstract. In this paper we study a special operator for sequential compo-sition, which is dened rela...
AbstractA TCSP-like concurrent language is extended with an operator for action refinement which pla...
Abstract ory of concurrency; the symbol; represents We present a simple process algebra which suppor...
We propose a theory of process refinement which relates behavioural descriptions belonging to concep...
We study an operator for refinement of actions to be used in the design of concurrent systems. Actio...
Development by formal stepwise renement offers a guarantee that an implementation satises a specicat...
AbstractCoordination seems to require (at least in part) a persistent repository of information that...
AbstractIn this paper we present a Process Algebra for the specification of concurrent, communicatin...
The semantic definition of action refinement on labelled configuration structures is compared with t...
For a process language with action refinement and synchronization both an operational and a denotati...
Action refinement is an essential operation in the design of concurrent systems, real-time or not. I...
AbstractRefinement of actions allows one to design systems in a top-down style, changing the level o...
Action refinement in process algebras has been widely studied in the last few years as a means to su...
In this paper, we present a process algebra with a minimal form of semantics for actions given by de...
Abstract. In this paper, we present a process algebra with a minimal form of semantics for actions g...
Abstract. In this paper we study a special operator for sequential compo-sition, which is dened rela...
AbstractA TCSP-like concurrent language is extended with an operator for action refinement which pla...
Abstract ory of concurrency; the symbol; represents We present a simple process algebra which suppor...
We propose a theory of process refinement which relates behavioural descriptions belonging to concep...
We study an operator for refinement of actions to be used in the design of concurrent systems. Actio...
Development by formal stepwise renement offers a guarantee that an implementation satises a specicat...
AbstractCoordination seems to require (at least in part) a persistent repository of information that...
AbstractIn this paper we present a Process Algebra for the specification of concurrent, communicatin...
The semantic definition of action refinement on labelled configuration structures is compared with t...
For a process language with action refinement and synchronization both an operational and a denotati...
Action refinement is an essential operation in the design of concurrent systems, real-time or not. I...
AbstractRefinement of actions allows one to design systems in a top-down style, changing the level o...