Download:
|
by Ingo Czaja, Rob J. Van Glabbeek, Ursula Goltz
in “Advances in Petri Nets
ftp://Boole.stanford.edu/pub/atch.ps.gz
Add To MetaCart
Abstract:
We investigate how to restrict the concept of action refinement such that established interleaving equivalences for concurrent systems are preserved under these restricted refinements. We show that interleaving bisimulation is preserved under refinement if we do not allow to refine action occurrences deciding choices and action occurrences involved in autoconcurrency. On the other hand, interleaving trace equivalence is still not preserved under these restricted refinements.
Citations
|
1096
|
A Calculus of Communicating Systems
– MILNER
- 1980
|
|
551
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
129
|
Petri nets, event structures and domains
– Nielsen, Plotkin, et al.
- 1981
|
|
57
|
Towards action-refinement in process algebras
– Aceto, Hennessy
- 1993
|
|
47
|
Adding action refinement to a finite process algebra
– Bravetti, Aceto, et al.
- 1994
|
|
44
|
Permutation of transitions : an event structure semantics for ccs
– Boudol, Castellani
- 1988
|
|
39
|
A survey of behaviour and equivalence preserving refinements of Petri nets
– Brauer, Gold, et al.
- 1990
|
|
35
|
Bisimulation and action refinement
– Vogler
|
|
31
|
Refinement of Actions in Causality Based Models
– Glabbeek, Goltz
- 1990
|
|
24
|
Failure semantics based on interval semiwords is a congruence for refinement
– Vogler
- 1991
|
|
22
|
Flow event structures and flow nets
– Boudol
- 1990
|
|
22
|
F~ally abstract models for a process language with refinement
– Nielsen, Engberg, et al.
- 1989
|
|
10
|
Equivalences and refinement
– Glabbeek, Goltz
- 1990
|
|
9
|
Maximality preserving bisimulation
– Devillers
- 1992
|
|
4
|
Degano: Event structures, Causal trees, and Refinements
– Darondeau, Degano
- 1990
|
|
3
|
Goltz: A Deadlock-sensitive Congruence for Action Refinement, SFB-Bericht Nr
– Glabbeek, U
- 1990
|