by Arend Rensink, Heike Wehrheim
Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS'97
http://www.cs.utwente.nl/~rensink/papers/MFCS97.ps
Add To MetaCart
Abstract:
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.
Citations
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
541
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
151
|
Bisimulation can't be traced
– Bloom, Istrail, et al.
- 1995
|
|
76
|
Basic notions of trace theory
– Mazurkiewicz
- 1988
|
|
57
|
Towards action-refinement in process algebras
– Aceto, Hennessy
- 1993
|
|
46
|
Adding Action Refinement to a Finite Process Algebra
– Aceto, Hennessy
- 1994
|
|
24
|
Failures semantics based on interval semiwords is a congruence for re nement
– Vogler
- 1991
|
|
22
|
Fully abstract models for a process language with re nement
– Nielsen, Engberg, et al.
- 1989
|
|
20
|
Refining Interfaces of Communicating Systems
– Brinksma, Jonsson, et al.
- 1991
|
|
19
|
Action systems and action refinement in the development of parallel systems
– Janssen, Poel, et al.
- 1991
|
|
17
|
Concurrency vs. interleaving: An instructive example
– Castellano, Michelis, et al.
- 1987
|
|
14
|
General Refinement and Recursion Operators for the Petri Box Calculus
– Best, Devillers, et al.
- 1993
|
|
14
|
Axiomatising ST-Bisimulation Equivalence
– Busi, Glabbeek, et al.
- 1994
|
|
13
|
A causal operational semantics of action refinement
– Degano, Gorrieri
- 1995
|
|
13
|
Weak sequential composition in process algebra
– Rensink, Wehrheim
- 1994
|
|
12
|
Comparing syntactic and semantic action refinement
– Goltz, Gorrieri, et al.
- 1996
|
|
10
|
Equivalences and refinement
– Glabbeek, Goltz
- 1990
|
|
10
|
Testing equivalences for Petri nets with action refinement
– Jategaonkar, Meyer
- 1992
|
|
9
|
A categorical view of process refinement
– Degano, Gorrieri, et al.
- 1992
|
|
8
|
Refinement of actions in event structures and causal trees
– Darondeau, Degano
- 1993
|
|
8
|
Posets for configurations
– Rensink
- 1992
|
|
8
|
Methodological aspects of action refinement
– Rensink
- 1994
|
|
6
|
Action Refinement and Property Inheritance in Systems of Sequential Agents
– Huhn
- 1996
|
|
5
|
An event-based SOS for a language with refinement
– Rensink
- 1995
|
|
5
|
Action refinement as an implementation relation
– Rensink, Gorrieri
- 1997
|
|
5
|
Parametric Action Refinement
– Wehrheim
- 1994
|
|
4
|
Specifying Reactive Systems with Action Dependencies: Modelling and Hierarchical Design
– Wehrheim
- 1996
|
