H. Lin. Symbolic bisimulation and proof systems for the #-calculus. Technical Report 7/94, School of Cognitive and Computing Sciences, University of Sussex, UK, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....which the running process is considered to depend on. Analogous instantition strategies are a common feature of symbolic semantics for data dependent calculi [HL95] Indeed, a call byneed discipline underlies the alternative characterizations of late and open calculus semantics presented in [Lin95, Lin94] and [San96] respectively. The relationship between their approach and the one proposed here deserves further investigation. What is immediately evident is the difference at the extensional level. Symbolic semantics is defined as closure over a family of bisimulation relations indexed by ....

H. Lin. Symbolic Bisimulation and Proof Systems for the -Calculus. Technical Report 7/94, School of Cognitive and Computing Sciences, University of Sussex, 1994.

....proceedings of TAPSOFT 95, Lecture Notes in Computer Science 915. 1 The original calculus paper [10] 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, ....

.... 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 late and early weak observation congruences. These proof systems are extensions of those for late and early strong bisimulations, as proposed in [7], with the three laws. They consist of a set of inference rules together with some standard equations. The judgments of the inference systems are of the form where t; u are calculus terms and C, called a condition, is a set of equality or inequality tests between names. It is important to ....

[Article contains additional citation context not shown here]

H. Lin (1994), Symbolic bisimulations and proof systems for the -calculus. Report ISCAS-LCS-94-06, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences.

....rules dealing with speci c language constructs needed for timed automata, the standard monoid laws for bisimulation are sucient for characterizing bisimulation in the timed world. This result agrees with the previous works on proof systems for value passing processes [HL96] and for calculus [Lin94], providing a further evidence that the four monoid laws capture the essence of bisimulation. The proof system presented in the current paper is complete only over nite timed automata, i.e. the subset of timed automata which do not involve loops. We conjecture that by adding a suitable version of ....

H. Lin. Symbolic bisimulations and proof systems for the -calculus. Report 7/94, Computer Science, University of Sussex, 1994.

....Axiomatisation for the calculus 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 ....

.... 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 present paper are: 1) Presenting proof ....

[Article contains additional citation context not shown here]

H. Lin. Symbolic bisimulations and proof systems for the -calculus. Report 7/94, Computer Science, University of Sussex, 1994.

....for regular pure CCS. It is shown that the proof systems are sound, and also complete when restricted to the subset of calculus where recursions are guarded and the parallel composition is disallowed. These results on the one hand extend the proof systems for recursion free calculus in [Lin94, Lin95] to in nite processes, on the other hand extend the inference system for guarded regular pure CCS of [Mil84] to calculus. 1 Introduction There has been growing interest in providing sound and complete proof systems for the calculus. Various notions of equivalences have been axiomatised: ....

....the inference system for guarded regular pure CCS of [Mil84] to calculus. 1 Introduction There has been growing interest in providing sound and complete proof systems for the calculus. Various notions of equivalences have been axiomatised: late and early strong bisimulation congruence [PS93, BD94, Lin94], open bisimulation [San93] late and early weak bisimulation equivalences [Lin95] and testing equivalences [Hen91, BD92] Di erent styles of proof systems have been used: equational axiomatisation [PS93, San93] and symbolic inference systems [BD94, Lin94, Lin95] All these proof systems are ....

[Article contains additional citation context not shown here]

H. Lin. Symbolic bisimulations and proof systems for the -calculus. Report 7/94, Computer Science, University of Sussex, 1994.

....be further compared after matching input actions (one for each possible instantiation of the input names) rendering any computation directly based on the de nition ine ective. To overcome this in nite branching problem the notion of symbolic bisimulation has been proposed for the calculus [Lin94, Lin95a]. It was adapted from the work on symbolic bisimulation for general value passing processes [HL95, HL96] A symbolic bisimulation is a family of binary relations over processes, indexed by conditions (boolean combinations of equality tests over nite sets of names) Instead of instantiating an ....

H. Lin. Symbolic bisimulations and proof systems for the -calculus. Report 7/94, Computer Science, University of Sussex, 1994.

....rules dealing with specific language constructs needed for timed automata, the standard monoid laws for bisimulation are sufficient for characterizing bisimulation in the timed world. This result agrees with the previous works on proof systems for value passing processes [HL96] and for calculus [Lin94], and provides a further evidence that the four monoid laws capture the essence of bisimulation. The proof system reported in the current paper is complete only over finite timed automata, i.e. the subset of timed automata that do not involve loops. We conjecture that by adding a suitable version ....

H. Lin. Symbolic bisimulations and proof systems for the -calculus. Report 7/94, Computer Science, University of Sussex, 1994. 15

No context found.

H. Lin. Symbolic bisimulation and proof systems for the #-calculus. Technical Report 7/94, School of Cognitive and Computing Sciences, University of Sussex, UK, 1994.

No context found.

H. Lin. Symbolic bisimulation and proof systems for the #-calculus. Technical Report 7/94, School of Cognitive and Computing Sciences, University of Sussex, UK, 1994.

No context found.

Huimin Lin. Symbolic bisimulation and proof systems for the -calculus. Technical Report 7/94, School of Cognitive and Computing Sciences, University of Sussex, UK, 1994.

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