(Enter summary)
Abstract: A higher-order process calculus is a calculus for communicating systems which contains
higher-order constructs like communication of terms. We analyse the notion of
bisimulation in these calculi. We argue that both the standard definition of bisimulation
(i.e., the one for CCS and related calculi), as well as higher-order bisimulation
[AGR88, Bou89, Tho90] are in general unsatisfactory, because of their overdiscrimination.
We propose and study a new form of bisimulation for such calculi,... (Update)
Cited by: More
The Algebra of - Finite State Processes
(Correct)
On the Expressive Power of Klaim-based Calculi - De Nicola, Gorla, al. (2004)
(Correct)
A Calculus of Bounded Capacities - Barbanera, Bugliesi.. (2003)
(Correct)
Similar documents (at the sentence level):
64.8%: Bisimulation for Higher-Order Process Calculi - Sangiorgi (1996)
(Correct)
Active bibliography (related documents): More All
0.3: π-Calculus, Internal Mobility, and Agent-Passing Calculi - Sangiorgi (1995)
(Correct)
0.3: Congruence Proofs for Weak Bisimulation Equivalences on.. - Baldamus, Frauenstein (1995)
(Correct)
0.2: Chapter 6. An Investigation into Functions as Processes - Unknown
(Correct)
Similar documents based on text: More All
0.2: On Bisimulations for the Asynchronous π-Calculus - Amadio, Castellani, Sangiorgi (1996)
(Correct)
0.1: Sound And Complete Translations From Sorted Higher-Order Logic.. - Kerber (1994)
(Correct)
0.1: Blind FIR Equalisation for High-Order QAM Signalling - Chen, Cook, Anderson
(Correct)
Related documents from co-citation: More All
23: Expressing Mobility (context) - Sangiorgi - 1993
18: Controlling interference in ambients
- Levi, Sangiorgi - 2000
15: Bisimulation congruences in safe ambients
- Merro, Hennessy - 2001
BibTeX entry: (Update)
D. Sangiorgi. Bisimulation for higher-order process calculi. Information and Computation, 131(2):141--178, 1996. http://citeseer.ist.psu.edu/sangiorgi96bisimulation.html More
@article{ sangiorgi96bisimulation,
author = "Davide Sangiorgi",
title = "Bisimulation for Higher-Order Process Calculi",
journal = "Information and Computation",
volume = "131",
number = "2",
pages = "141-178",
year = "1996",
url = "citeseer.ist.psu.edu/sangiorgi96bisimulation.html" }
Citations (may not include all citations):
854
Information and Computation (context) - Milner, Parrow et al. - 1992
322
volume 92 of Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
248
Expressing Mobility (context) - Sangiorgi - 1992
197
Barbed bisimulation
- Milner, Sangiorgi - 1992
179
The lazy lambda calculus
- Abramsky - 1989
104
Branching time and abstraction in bisimulation semantics (context) - van Glabbeek, Weijland - 1989
52
Towards a lambda calculus for concurrent and communicating s.. (context) - Boudol - 1989
49
A theory of bisimulation for the -calculus (context) - Sangiorgi - 1996
46
Calculi for Higher Order Communicating Systems (context) - Thomsen - 1990
45
A theory of processes with localities (context) - Boudol, Castellani et al. - 1994
44
internal mobility and agent-passing calculi (context) - Sangiorgi - 1996
42
Algebraic theories for name-passing calculi
- Parrow, Sangiorgi - 1995
32
A fully abstract denotational model for higher-order process.. (context) - Hennessy - 1993
22
a second generation calculus for higher-order processes (context) - Thomsen - 1993
22
Concurrency on automata and infinite sequences (context) - Park - 1981
20
Reasoning about higher-order processes
- Amadio, Dam - 1995
18
Distributed bisimulation (context) - Castellani, Hennessy - 1989
10
Generalized bisimulation in relational specifications (context) - Astesiano, Giovini et al. - 1988
9
the reduction of CHOCS bisimulation to -calculus bisimulatio.. (context) - Amadio - 1993
8
Process calculi with asynchronous communication (context) - Hansen, Kleist - 1994
8
Process calculus based upon evaluation to committed forms
- Pitts, Ross - 1996
7
Theoretical Computer Science (context) - Astesiano, Giovini et al. - 1992
1
The Algebra of Finite State Processes
- Sewell - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp-sop.inria.fr.html): More
RC Semantics using Rewriting Rules - Boussinot (1992)
(Correct)
ASAP - a protocol for symbolic computation systems - Dalmas, Gaëtano, Sausse (1994)
(Correct)
Tracking medical 3D data with a deformable parametric model - Bardinet, Cohen, Ayache
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC