D.J. Walker. Bisimulation and Divergence in CCS, LICS 1988  Home/Search   Document Not in Database   Summary   Related Articles   Check

....with a higher real complexity than the apparent complexity of the overall system. This is mainly due to the fact that parts need to be considered that can never be reached in the global context. Partial or loose specifications allow to cut off these unreachable parts (see section 4. 3) As in [ClSte90,Kr89,LaTh88,ShGr90,Wa88]) we will exploit this feature to take advantage of context information. Furthermore, we will refer to the size of the maximal transition system that is encountered by our method as the algorithmic complexity. Our method is tailored for establishing P j= OE, i.e. whether P satisfies the property ....

....knowledge about the alphabet of interest in order to abstract and minimize the system s components. Using hLi operations together with an elementary rule for distributing them over the parallel operator (see Proposition 3.4) our method covers this approach. Larsen and Thomsen [LaTh88] and Walker [Wa88] use partial specifications in order to take context constraints into account. Our method is an elaboration of theirs. It uses a more appropriate preorder and defines a concrete strategy for (semi )automatic proofs where the required user support is kept to a minimum. The methods proposed in ....

[Article contains additional citation context not shown here]

D.J. Walker. Bisimulation and Divergence in CCS, LICS 1988

....reasoning on the length of sequences of interactions that lead to a state in which an observability predicate holds. Weak polymorphic bisimulation would still be a sound technique for may testing; to make it sound for must testing, divergence should be taken into account, following Walker [Wal88]. The idea of polymorphic bisimulation in Section 12 can also be integrated with the definition of trace equivalence, which would yield another proof technique for may testing without context quantification. 46 16 Conclusions We have investigated the behavioral consequences of polymorphism in a ....

D. J. Walker. Bisimulation and divergence in CCS. In Proc. 3rd Symp. on Logic in Computer Science (LICS 88), pages 186--192. IEEE Computer Society Press, 1988.

....by an external observer unchanged. It is from the definition of congruence that equational laws may be derived. In addition to the three types of equivalence defined by Milner, there are a number of other equivalences and partial order relations defined on CCS agents [Hen88, Hoa85, Mol92, Wal88] Given the definition of congruence it is possible to define another form of analysis applicable to CCS agents called equational reasoning. Equational reasoning allows the practitioner to prove the congruence of two specified agents without the direct employment of any of the semantic rules of ....

D. Walker. Bisimulation and divergence in ccs. In Proceedings of the Third annual Symposium on Logic in Computer Science, pages 186--192. Computer Society Press, 1988.

....and composition is the problem of defining property preserving equivalence relations or preorders which are congruences, respectively precongruences for parallel composition and abstraction. This problem has been studied, for equivalences e.g. in [HM85,BK85,GS86,GW89,GS90b] and for preorders in [LT88a,Wal88,CS90,SG90,GL91]. The results presented here are based on those given in [BBLS92] where a general framework for property preserving abstractions is given. Program models are transition relations and abstractions are given by simulations, which are parameterized by a relation between the domains of both ....

D. J. Walker. Bisimulation and Divergence in CCS. In 3th Symposium on Logic in Computer Science (LICS 88), IEEE, 1988.

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