We propose a theory of process refinement which relates behavioural descriptions belonging to conceptually different abstraction levels, through a so-called vertical implementation relation. The theory is based on action refinement, which permits to relate abstract actions of the implementation to concrete computations of the implementation; it is developed in the standard interleaving approach. A number of proof rules is shown to be sound for the particular vertical implementation relation (based on observation congruence) we study in this paper. We give an illustrative example
. Action systems provide a general description of reactive systems, capable of modeling terminating,...
Humans can make a plan by refining abstract actions. Dynamic logic, which enables reasoning about th...
Abstract. This paper reconsiders refinements which introduce actions on the concrete level which wer...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
To help make refinement more usable in practice we introduce a general, flexible model of refinement...
Abstract. Action refinement is a practical hierarchical method to ease the design of large reactive ...
We study an operator for refinement of actions to be used in the design of concurrent systems. Actio...
Action refinement in process algebras has been widely studied in the last few years as a means to su...
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, ...
Abstract ory of concurrency; the symbol; represents We present a simple process algebra which suppor...
In the abstract modelling of distributed systems we may need methods to replace abstract behaviours ...
The action system formalism [3] is a state-based approach to distributed computing. In this paper, i...
Abstract. Action systems provide a general description of reactive systems, capable of modeling term...
. Action systems provide a general description of reactive systems, capable of modeling terminating,...
Humans can make a plan by refining abstract actions. Dynamic logic, which enables reasoning about th...
Abstract. This paper reconsiders refinements which introduce actions on the concrete level which wer...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
To help make refinement more usable in practice we introduce a general, flexible model of refinement...
Abstract. Action refinement is a practical hierarchical method to ease the design of large reactive ...
We study an operator for refinement of actions to be used in the design of concurrent systems. Actio...
Action refinement in process algebras has been widely studied in the last few years as a means to su...
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, ...
Abstract ory of concurrency; the symbol; represents We present a simple process algebra which suppor...
In the abstract modelling of distributed systems we may need methods to replace abstract behaviours ...
The action system formalism [3] is a state-based approach to distributed computing. In this paper, i...
Abstract. Action systems provide a general description of reactive systems, capable of modeling term...
. Action systems provide a general description of reactive systems, capable of modeling terminating,...
Humans can make a plan by refining abstract actions. Dynamic logic, which enables reasoning about th...
Abstract. This paper reconsiders refinements which introduce actions on the concrete level which wer...