Name
Abstract | ||
|---|---|---|
. A new formulation of the -calculus, where name instantiation is handledexplicitly, is presented. The explicit handling of name instantiation allows usto reduce the -calculus transitional semantics to a standard SOS framework.Hence, -calculus bisimulation models can take fully advantage of the SOS metatheorydeveloped for `static" process calculi. For instance, complete axiomatic characterizationsof -calculus bisimulation equivalences can be automatically derivedby turning SOS rules ... |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-58338-6_81 | MFCS |
Keywords | Field | DocType |
late semantics,explicit substitutions,process calculi | Transition system,Discrete mathematics,Metatheory,Combinatorics,Axiom,Computer science,Bisimulation,Rule of inference,Process calculus,Semantics,Universal quantification | Conference |
ISBN | Citations | PageRank |
3-540-58338-6 | 7 | 1.15 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gian Luigi Ferrari | 1 | 731 | 59.95 |
| Ugo Montanari | 2 | 6297 | 1135.53 |
| Paola Quaglia | 3 | 356 | 27.06 |