Name
Abstract | ||
|---|---|---|
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the *** -calculus. In particular, effective coinductive characterizations of barbed congruence, such as the notion of normal bisimulation developed by Sangiorgi for the higher-order *** -calculus, are difficult to obtain. In this paper, we study bisimulations in two simple higher-order calculi with a passivation operator, that allows the interruption and thunkification of a running process. We develop a normal bisimulation that characterizes barbed congruence, in the strong and weak cases, for the first calculus which has no name restriction operator. We then show that this result does not hold in the calculus extended with name restriction. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-00596-1_19 | FoSSaCS |
Keywords | Field | DocType |
name restriction operator,effective coinductive characterization,behavioral theory,name restriction,higher-order process calculus,simple higher-order calculus,normal bisimulations,weak case,passivation operator,normal bisimulation,barbed congruence,higher order,process calculi | Algorithm,Behavioral theory,Coinduction,Bisimulation,Operator (computer programming),Passivation,Process calculus,Congruence (geometry),Mathematics,Calculus | Conference |
Volume | ISSN | Citations |
5504 | 0302-9743 | 12 |
PageRank | References | Authors |
0.55 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergueï Lenglet | 1 | 89 | 9.15 |
| Alan Schmitt | 2 | 96 | 7.30 |
| Jean-Bernard Stefani | 3 | 1201 | 77.02 |