D. Sangiorgi. A theory of bisimulation for the - calculus. Acta Informatica, 33(1):6997, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Comparing Higher-Order Encodings in Logical.. - Bruni, Honsell.. (2002) (2 citations) (Correct)
....2. Late operational semantics of calculus. taken up to equivalence. For X N , we let PX , fP 2 P j fn(P ) Xg. Capture avoiding substitution of y in place of x in P is denoted by Pfy=xg. There is a plethora of slightly di erent lts s for the late operational semantics of calculus, e.g. [26,25,30]. We present the original one in [26] the relation is the smallest relation on processes, satisfying the rules in Figure 2 (with the obvious rules PAR r and COM r omitted) There are four kinds of actions, ranged over by . Action is the silent move, and xy is the free output : P Q ....
Sangiorgi, D., A theory of bisimulation for the -calculus, Acta Informatica 33 (1996), pp. 69-97.
Discrimination by Parallel Observers - Mariangiola Dezani-Ciancaglini.. (Correct)
....of observational equivalence is simpler: indeed testing bisimulation amounts to verifying the behaviours of processes at intermediate steps of computation rather than just the input output relation. Then, as pointed out in [6] there are various notions of bisimulation (see for example [17] 18] [22]) and there is no consensus on which is the proper one. On the other side, the calculus of multiplicities of [8] does not seem of independent interest, while syatems similar to the concurrent calculus have been studied in di erent papers [7] 20] 21] 2] 11] 12] As a byproduct of ....
D. Sangiorgi, \A Theory of Bisimulation for the -calculus", Proceedings of CONCUR'93, LNCS 715, Springer-Verlag, Berlin, 1993, 121-136.
Comparing Higher-Order Encodings in Logical.. - Bruni, Honsell.. (2001) (2 citations) (Correct)
....2. Late operational semantics of # calculus. taken up to # equivalence. For X , we let P # P fn(P ) X . Capture avoiding substitution of y in place of x in P is denoted by P y x . There is a plethora of slightly di#erent lts s for the late operational semantics of # calculus, e.g. [25,24,29]. We present the original one in [25] the relation is the smallest relation on processes, satisfying the rules in Figure 2 (with the obvious rules PAR r and COM r omitted) There are four kinds of actions, ranged over by . Action # is the silent move, and xy is the free output : P Q means ....
Sangiorgi, D., A theory of bisimulation for the #-calculus, Acta Informatica 33 (1996), pp. 69--97.
Extending CORBA Interfaces with Protocols - Canal, Fuentes, Pimentel.. (2001) (Correct)
....checks do not need such a heavy machinery as theorem provers, but still they are (theoretically) untractable because they need to explore all branches of the expansion tree of the protocols. However, by means of a specialized transition system such as the one proposed by Sangiorgi for bisimulation [Sangiorgi, 1993], it is possible to develop e#cient tools for the automated checking of the relations proposed in this paper. In addition, most of the component protocol descriptions in real applications are usually very simple, and therefore even the protocol tests with an a priori exponential complexity can be ....
Sangiorgi, D. (1993). A theory of bisimulation for the #-calculus. Technical Report ECS-LFCS-93-270, University of Edinburgh. (A preliminary version published in the Proceedings of CONCUR'93).
Complete Inference Systems for Weak Bisimulation Equivalences in.. - Lin (1995) (7 citations) (Correct)
....only gave an axiomatisation for the late version of strong ground bisimulation. Subsequently, e orts have been made to formulate complete proof systems for other equivalences for this calculus: 12, 2, 7] for both early and late strong bisimulation congruences, 4, 1] for testing equivalence, and [13] for (strong) open bisimulation. It has been widely conjectured that axiomatisation for weak bisimulations can be obtained by adding Milner s laws to proof systems for strong equivalences [10, 12, 2] In this paper we shall verify this conjecture by presenting complete proof systems for both ....
....and is an action. Intuitively b represents the environments under which the action can actually be red from t. In the setting of the calculus b will be a set of matches, i.e. equality tests on names. This kind of transition has also been used in the work on open bisimulation by Sangiorgi [13]. The symbolic transitional semantics of the calculus is given in Figure 2, where we use M; N; L to range over sets of matches. For notational convenience we write MN for the union of M and N . Also the symmetric rules for Sum and Par have been omitted. u then n(M) fn( fn(t) ....
[Article contains additional citation context not shown here]
Davide Sangiorgi (1996), A theory of bisimulation for the -calculus. Acta Informatica, 33, 69-97.
Complete Proof Systems for Observation Congruences in.. - Lin (1998) (1 citation) (Correct)
....has received extensive studies since the infancy of this calculus. Di erent bisimulation equivalences in the recursion free subset of the calculus have been successfully axiomatised: late ground bisimulation [9] late early strong bisimulation congruences [10, 1, 4] open bisimulation [11], late early weak bisimulation congruences [5] styles of proof systems have been exploited: equational axiomatisation [10, 11] and symbolic inference systems [1, 4, 5] To deal with recursion, 6] proposed a version of Unique xpoint induction, thus obtained complete proof systems for both late ....
.... subset of the calculus have been successfully axiomatised: late ground bisimulation [9] late early strong bisimulation congruences [10, 1, 4] open bisimulation [11] late early weak bisimulation congruences [5] styles of proof systems have been exploited: equational axiomatisation [10, 11] and symbolic inference systems [1, 4, 5] To deal with recursion, 6] proposed a version of Unique xpoint induction, thus obtained complete proof systems for both late and early strong bisimulation congruence in nite control calculus with guarded recursions. The main contributions of the ....
Davide Sangiorgi. A theory of bisimulation for the -calculus. Acta Informatica, 33:69-97, 1996. 12
Towards an Algebraic Theory of Typed Mobile Processes - Deng, Sangiorgi (2004) Self-citation (Sangiorgi) (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the #-calculus. Acta Informatica, 33:69--97, 1996.
Towards an Algebraic Theory of Typed Mobile Processes - Deng, Sangiorgi Self-citation (Sangiorgi) (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the #-calculus. Acta Informatica, 33:69-- 97, 1996.
On Bisimulations for the Asynchronous π-calculus? - Amadio, Castellani, Sangiorgi (1997) Self-citation (Sangiorgi) (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the -calculus. In Best, editor, Proc. CONCUR93, 1993. Springer Lect. Notes in Comp. Sci. 715.
Models for Name-Passing Processes: Interleaving and Causal.. - Cattani, Sewell (2000) (4 citations) (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the - calculus. Acta Informatica, 33(1):6997, 1996.
Observational Congruences for Dynamically Reconfigurable .. - Bruni, Montanari.. (Correct)
No context found.
D. Sangiorgi, A theory of bisimulation for the #-calculus, Acta Inform. 33 (1996) 69--97.
Discrimination by Parallel Observers - Mariangiola Dezani-Ciancaglini.. (Correct)
No context found.
D. Sangiorgi, \A Theory of Bisimulation for the -calculus", Proceedings of CONCUR'93, LNCS 715, Springer-Verlag, Berlin, 1993, 121-136.
History Dependent Automata - Montanari, Pistore (2001) (3 citations) (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for -calculus. Acta Informatica, 33:69--97, 1996.
Modeling Fresh Names in the π-calculus Using.. - Bruni, Honsell, Lenisa.. (2002) (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the #-calculus. Acta Informatica, 33:69-- 97, 1996.
A Proof Search Specification of the π-Calculus - Tiu, Miller (2004) (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the #-calculus. Acta Informatica, 33(1):69--97, 1996.
Electronic Notes in Theoretical Computer Science 68 No. 6 (2003) - Url Http Www (Correct)
No context found.
Davide Sangiorgi. A theory of bisimulation for the #-calculus. Acta Informatica, vol. 33, 1996, pp. 69--97. 18
Observational Congruences for Dynamically Reconfigurable .. - Bruni, Montanari.. (2003) (Correct)
No context found.
D. Sangiorgi, A theory of bisimulation for the #-calculus, Acta Inform. 33 (1996) 69--97.
Deciding Framed Bisimilarity - Hans Uttel Brics (2002) (1 citation) (Correct)
No context found.
Davide Sangiorgi. A theory of bisimulation for the #-calculus. Acta Informatica, vol. 33, 1996, pp. 69--97. 20
Symbolic Equivalences for Open Systems - Baldan, al. (2003) (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the -calculus. Acta Inform., 33:69-97, 1996.
Modeling Fresh Names in the π-calculus Using Abstractions - Bruni, al. (2004) (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the #-calculus. Acta Informatica, 33:69--97, 1996.
A Hierarchy of Equivalences for Asynchronous Calculi - Fournet, Gonthier (2003) (16 citations) (Correct)
No context found.
Davide Sangiorgi. A theory of bisimulation for the -calculus. Acta Informatica, 33:69--97, 1996.
A Proof Search Specification of the π-Calculus - Tiu, Miller (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the #-calculus. Acta Informatica, 33(1):69--97, 1996.
A Proof Search Specification of the π-Calculus - Tiu, Miller (2004) (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the #-calculus. Acta Informatica, 33(1):69--97, 1996.
Modeling Fresh Names in the π-calculus Using.. - Bruni, Honsell, Lenisa.. (Correct)
No context found.
D. Sangiorgi. A theory of bisimulation for the #-calculus. Acta Informatica, 33:69-- 97, 1996.
A Symbolic Approach to Value-Passing Processes - Ingólfsdóttir, Lin (Correct)
No context found.
D. Sangiorgi. A Theory of bisimulation for -calculus. Acta Informatica, 33, 1996.
First 50 documents
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