G. Ferrari, U. Montanari and P. Quaglia (1995), The weak late -calculus semantics as observation equivalence. In Proc. CONCUR'95, Vol 962, Lecture Notes in Computer Science, Springer{Verlog. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Complete Inference Systems for Weak Bisimulation Equivalences in.. - Lin (1995) (7 citations) (Correct)
....reason is that E INPUT does not rely on mismatch, and one objective of this paper is to demonstrate that complete inference systems can be formulated for the calculus without mismatch. If mismatch is allowed then E INPUT can be replaced by EA. A proof of this fact is provided in the Appendix. [3] proposed an axiomatization for weak late observation equivalence for the calculus. In their work the calculus was extended with environments recording the information about which names are equal and which are private. In contrast, in the present paper such information is kept in conditions ....
G. Ferrari, U. Montanari and P. Quaglia (1995), The weak late -calculus semantics as observation equivalence. In Proc. CONCUR'95, Vol 962, Lecture Notes in Computer Science, Springer{Verlog.
Final Semantics for the pi-calculus - Honsell, Lenisa, Montanari, Pistore (1998) Self-citation (Montanari) (Correct)
....names currently available for interaction: i.e. fn(p) a. When two processes p and q are compared, it is sufficient to choose a 2 P fin (name) so that fn(p) fn(q) a and to compare (a; p) and (a; q) This idea of associating the set of free names to a calculus process has been used also in [4] to obtain a characterization of calculus based on ordinary transition systems and bisimulations. In the sequel we fix a function e : P fin (name) name such that, for all a name, the value x a of e on a is not in a. We shall denote by a the finite set of names a [ fx a g: Throughout this ....
G.-L.Ferrari, U.Montanari, P.Quaglia. The weak late -calculus semantics as observation equivalence. LNCS 962. Springer, 1995.
On the Finitary Characterization of pi-Congruences - Quaglia (1997) Self-citation (Quaglia) (Correct)
....the environment with the name associations activated by the symbolic transition P ff;C Gamma P 0 , while the function ffi yields a concrete observable action. So, the extensional semantics of the calculus is given as standard strong and weak bisimulations and observational congruence. In [FMQ95] and [FMQ96] it was shown that suitable distinct definitions of (M) and of the pair (j; ffi ) lead to the operational and axiomatic characterization of both late and early, either strong or weak, ground calculus semantics. The challenging issue of characterizing the corresponding full congruences ....
....This, on its side, adds 44 effectiveness to the very first alternative characterization we presented. Also, interpreting late congruence as bisimilarity of ground processes permits equational characterizations for non groundness to be directly stated on the calculus axiom system for groundness [FMQ95]. Eventually, by introducing the non ground dual of ground calculus, we exploited, for the characterization of both late and open semantics, a more promising call by need discipline for the instantiation of the arguments which the running process is considered to depend on. Analogous ....
G.-L. Ferrari, U. Montanari, and P. Quaglia. The Weak Late -calculus Semantics as Observation Equivalence. In I. Lee and S.A. Smolka, editors, Proc. 6th International Conference on Concurrency Theory, CONCUR '95, volume 962 of LNCS, pages 57--71. Springer-Verlag, 1995.
Towards a Semantic-Based Verification Environment for the .. - Ferrari, Modoni, Quaglia (1995) (2 citations) Self-citation (Ferrari Quaglia) (Correct)
.... verification tools developed for static process calculi (e.g. CPS93] we refer to [IP91, Mad92] for a survey) cannot be directly re used for the calculus, and, up to now, the only available verification tool [VM94] decides a bisimulation equivalence which is rather strong [San93] In [FMQ94, FMQ95] an alternative formulation the calculus operational semantics has been proposed. There, contrary to the original definition, name substitutions are explicitly handled via the introduction of a suitable state operator. This allowed the characterization of calculus operational semantics as ....
....This paper addresses the issue of program verification in the calculus. In particular, our long term goal is to provide a general verification environment for manipulating and analyzing mobile systems specified in the calculus. To this purpose, we explore the ideas and the techniques of [FMQ94, FMQ95] to develop a semantic based verification environment for the calculus. In the current prototype version, the environment provides two main facilities: a calculus interpreter equipped with a graphical interface, and a verification tool which is used to decide (strong and weak) early and late ....
[Article contains additional citation context not shown here]
G.-L. Ferrari, U. Montanari, and P. Quaglia. The Weak Late -calculus Semantics as Observation Equivalence. In CONCUR '95, volume 962 of LNCS, Springer-Verlag, 1995.
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