Titlebook: Algebra of Communicating Processes; Proceedings of ACP94 A. Ponse,C. Verhoef,S. F. M. Vlijmen Conference proceedings 1995 British Computer

表狀態(tài)

NIL

Pde5-Inhibitors

A Correctness Proof of the Bakery Protocol in ,CRL, using a proof system that has been developed for .CRL. The proof primarily consists of algebraic manipulations based on specifications of abstract data types and elementary rules and axioms from process algebra.

偏狂癥

Inductive Proofs with Sets, and some Applications in Process Algebra,duction can be used for the derivation of alternative schemes. This way, considerable flexibility can be obtained for proofs in the inductive theory for the sets. For more general purposes we formulate a rule for ‘hybrid’ induction, which allows a variety of induction schemes..A number of examples i

Prostatism

Formal Semantics of Interworkings with Discrete Absolute Time,ting, the continuous time domain is partitioned into slices. First, a set of axioms is presented for discretely timed interworkings. Then the notion of discrete time intervals is defined. From this definition and the axioms for discretely timed interworkings, a set of propositions for interval timed

CRUMB

,The ABP and the CABP — a Comparison of Performances in Real Time Process Algebra, are specified and verified algebraically. Also a short introduction into real time ACP is given. We conclude that real time ACP is a fine formalism to work with, although we need a weaker equivalence for the verification of protocols than branching bisimulation, which we use throughout this paper.

滔滔不絕的人