## DYNAMIC CONGRUENCE vs. PROGRESSING BISIMULATION for CCS (1992)

### Cached

### Download Links

- [www.dcs.qmw.ac.uk]
- [eprints.ecs.soton.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | Fundamenta Informaticae |

Citations: | 33 - 12 self |

### BibTeX

@ARTICLE{Montanari92dynamiccongruence,

author = {Ugo Montanari and Vladimiro Sassone},

title = {DYNAMIC CONGRUENCE vs. PROGRESSING BISIMULATION for CCS},

journal = {Fundamenta Informaticae},

year = {1992},

volume = {16},

pages = {171--196}

}

### Years of Citing Articles

### OpenURL

### Abstract

Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. ff:ø:fi:nil and ff:fi:nil are woc but ø:fi:nil and fi:nil are not. This fact prevent us from characterizing CCS semantics (when ø is considered invisible) as a final algebra, since the semantic function would induce an equivalence over the agents that is both a congruence and a bisimulation. In the paper we introduce a new behavioural equivalence for CCS agents, which is the coarsest among those bisimulations which are also congruences. We call it Dynamic Observational Congruence because it expresses a natural notion of equivalence for concurrent systems required to simulate each other in the presence of dynamic, i.e. run time, (re)configurations. We provide an algebraic characterization of Dynamic Congruence in terms of a universal property of finality. Furthermore we introduce Progressing Bisimulatio...

### Citations

1332 | A Calculus of Communicating Systems - Milner - 1980 |

1289 | A Structured Approach to Operational Semantics - Plotkin - 1981 |

655 |
Concurrency and automata on infinite sequences
- Park
- 1981
(Show Context)
Citation Context ... overview and a comparison of many behavioural equivalences see, for instance, [DeN87] or [GvG89]. Among the equivalences proposed in the literature, we consider those based on bisimulation ([Mil80], =-=[Par81]-=-, [vGW89]). Two processes are equivalent if they not only produce the same observations, but also reach equivalent states afterwards and, in the case of Branching Bisimulation, pass only through equiv... |

495 | R.: Algebraic laws for nondeterminism and concurrency - Hennessy, Milner - 1985 |

352 | Kommunikation mit automaten - Petri - 1962 |

274 | An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types - Goguen, Thatcher, et al. - 1976 |

256 | Branching Time and Abstraction in Bisimulation Semantics - Glabbeek, Weijland - 1996 |

236 | Modeling concurrency with partial orders - PRATT - 1986 |

201 | Non-Well-Founded Sets - Aczel - 1988 |

159 | Formal verification of parallel programs - KELLER - 1976 |

120 | A domain equation for bisimulation - Abramsky - 1991 |

91 | Extensional equivalences for transition systems - Nicola - 1987 |

77 | A Lattice Theoretical Fixpoint Theorem and its Applications - Tarski - 1955 |

70 | U.: Equivalence notions for concurrent systems and refinement of actions - Glabbeek, Goltz - 1989 |

64 | G.: Petri nets, event structures and domains, part 1. Theoretical Computer Science 13 - Nielsen, Plotkin, et al. - 1981 |

31 | Concurrency and Communication - Milner - 1988 |

31 | Bounded nondeterminism and the approximation induction principle in process algebra - Glabbeek - 1987 |

23 | A partial ordering semantics for CCS - Degano, Nicola, et al. - 1990 |

13 |
U.: Towards the unification of models for concurrency
- Ferrari, Montanari
- 1990
(Show Context)
Citation Context ...the elegance of the proofs and their relationship with equivalences based on logics ([Mil89]), on denotational semantics ([Ab88]) and on algebraic techniques ([BB88], [Acz87]). Ferrari and Montanari (=-=[FM90]-=-) define Strong Observational Congruence, the simplest equivalence based on bisimulation, in an algebraic way. They see the CCS transition system as equipped with an algebraic structure on both states... |

6 | Canonical representatives for observational equivalence classes - MONTANARI, SGAMMA - 1989 |

6 |
Unifying Models of Concurrency
- Ferrari
- 1990
(Show Context)
Citation Context ... 3.2 Algebraic characterization In this subsection we show that ≈ d has a corresponding object in CatLCCS, the category of CCS computations whose construction is due to Ferrari and Montanari ([FM90], =-=[F90]-=-). Here, the construction of CatLCCS is based on [FMM91]. As we have seen in section 2, the operational semantics of CCS is defined by deductive systems. Now, we structure those systems as type algebr... |

5 | On Causality Observed Incrementally, Finally - Ferrari, Montanari, et al. - 1991 |

5 | CCS Dynamic Bisimulation is Progressing - Montanari, Sassone - 1991 |

2 | Dynamic Bisimulation - Montanari, Sassone - 1990 |

1 | Unifying Models of Concurrency. PhD thesis, TD-4/90, Dipartimento di Informatica, Universit`a di - Ferrari - 1990 |