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

極小

,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.

善于騙人

Definability with the State Operator in Process Algebra,n which a process can act. The state space is always assumed to be finite. In this work we obtain some results about extensions of process algebras with the state operator. Furthermore, we show that if only linear equations are considered then every process definable using this operator can be defined in ACP with renamings.

失眠癥

hypnotic

逢迎白雪

路標(biāo)

https://doi.org/10.1007/978-1-84882-244-3the language contains only basic constructs with an easy semantics. To obtain executability, ..CRL has been defined. In effective .CRL equivalence between closed . is decidable and the operational behaviour is finitely branching and computable. This makes effective .CRL a good platform for tooling activities.

BOLUS

Conclusions and Future Research, 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.

中世紀(jì)

Bother

滴注

David R. Crowe,Michael Morgan,Kara Trappn which a process can act. The state space is always assumed to be finite. In this work we obtain some results about extensions of process algebras with the state operator. Furthermore, we show that if only linear equations are considered then every process definable using this operator can be defined in ACP with renamings.