標(biāo)題: Titlebook: Algebra of Communicating Processes; Proceedings of ACP94 A. Ponse,C. Verhoef,S. F. M. Vlijmen Conference proceedings 1995 British Computer [打印本頁] 作者: Retina 時間: 2025-3-21 20:08
書目名稱Algebra of Communicating Processes影響因子(影響力)
書目名稱Algebra of Communicating Processes影響因子(影響力)學(xué)科排名
書目名稱Algebra of Communicating Processes網(wǎng)絡(luò)公開度
書目名稱Algebra of Communicating Processes網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algebra of Communicating Processes被引頻次
書目名稱Algebra of Communicating Processes被引頻次學(xué)科排名
書目名稱Algebra of Communicating Processes年度引用
書目名稱Algebra of Communicating Processes年度引用學(xué)科排名
書目名稱Algebra of Communicating Processes讀者反饋
書目名稱Algebra of Communicating Processes讀者反饋學(xué)科排名
作者: Ptosis 時間: 2025-3-21 23:52
Conference proceedings 1995 contributions, three were submitted by the invited speakers and the others were selected by the programme committee. As for the presentations, Jos Baeten, Rob van Glabbeek, Jan Friso Groote, and Frits Vaandrager were each invited to deliver a lecture. A paper relating to Frits Vaandrager‘s lecture 作者: 浮雕 時間: 2025-3-22 02:37
https://doi.org/10.1007/978-3-319-31566-9ly branching process. Due to the noncomputable communication function, the version of aprACP employed is still not effective..However, I also define a wide class of De Simone languages that are expressible in an effective version of aprACP. This class includes the effective versions of CCS, SCCS, AC作者: grounded 時間: 2025-3-22 07:22
On the Expressiveness of ACP,ly branching process. Due to the noncomputable communication function, the version of aprACP employed is still not effective..However, I also define a wide class of De Simone languages that are expressible in an effective version of aprACP. This class includes the effective versions of CCS, SCCS, AC作者: 思想流動 時間: 2025-3-22 11:25
1431-1682 n Will em Klop in the early eighties. These proceedings comprise the contributions to ACP94, the first workshop devoted to ACP. The work- shop was held at Utrecht University, 16-17 May 1994. These proceedings are meant to provide an overview of current research in the area of ACP. They contain fifte作者: Interdict 時間: 2025-3-22 13:49
Comparison of Deadlock Prevention Policies,ssed in detail. It is shown that the bag cannot be recursively defined without merge..We introduce fixed point algebras which have interesting applications in several proofs. An example is presented of a fixed point algebra which has an undecidable word problem.作者: 從屬 時間: 2025-3-22 19:52 作者: 北極熊 時間: 2025-3-22 22:01
Mast Cell Disease (Urticaria Pigmentosa)rotocol, where an initial leader is present. In the second protocol this assumption is dropped. Eventually a fault-tolerant protocol is constructed, where components may crash and revive spontaneously..Both the protocols and the required behaviour are formally specified in ACP. Some remarks are made about a formal verification of the protocols.作者: 偶像 時間: 2025-3-23 02:12
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes,ssed in detail. It is shown that the bag cannot be recursively defined without merge..We introduce fixed point algebras which have interesting applications in several proofs. An example is presented of a fixed point algebra which has an undecidable word problem.作者: 放棄 時間: 2025-3-23 09:23
Process Specification in a UNITY Format, operator . and conditions and, finally, the correspondence with a term rewriting system, which opens certain perspectives with respect to the validation and verification of a specification. Throughout the paper the simple and well-known PAR protocol serves as a running example.作者: Obstacle 時間: 2025-3-23 13:31
Algebraic Specification of Dynamic Leader Election Protocols in Broadcast Networks,rotocol, where an initial leader is present. In the second protocol this assumption is dropped. Eventually a fault-tolerant protocol is constructed, where components may crash and revive spontaneously..Both the protocols and the required behaviour are formally specified in ACP. Some remarks are made about a formal verification of the protocols.作者: Malcontent 時間: 2025-3-23 16:28
Conference proceedings 1995Klop in the early eighties. These proceedings comprise the contributions to ACP94, the first workshop devoted to ACP. The work- shop was held at Utrecht University, 16-17 May 1994. These proceedings are meant to provide an overview of current research in the area of ACP. They contain fifteen contrib作者: 藕床生厭倦 時間: 2025-3-23 19:24 作者: monochromatic 時間: 2025-3-23 23:27 作者: 盡管 時間: 2025-3-24 03:55
Workshops in Computinghttp://image.papertrans.cn/a/image/152516.jpg作者: ORBIT 時間: 2025-3-24 07:31 作者: 陳舊 時間: 2025-3-24 13:46 作者: 可轉(zhuǎn)變 時間: 2025-3-24 17:07 作者: JECT 時間: 2025-3-24 21:57
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.作者: Rankle 時間: 2025-3-25 00:07 作者: 極小 時間: 2025-3-25 04:37
,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.作者: 善于騙人 時間: 2025-3-25 11:16
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.作者: 失眠癥 時間: 2025-3-25 15:27 作者: hypnotic 時間: 2025-3-25 16:46 作者: 逢迎白雪 時間: 2025-3-25 21:32 作者: 路標(biāo) 時間: 2025-3-26 01:11
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 時間: 2025-3-26 08:11
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ì) 時間: 2025-3-26 12:09 作者: Bother 時間: 2025-3-26 13:19 作者: 滴注 時間: 2025-3-26 18:28
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.作者: Palpitation 時間: 2025-3-27 00:18
Subcutaneous Panniculitis-like Lymphomaernative way of specifying an existing traffic regulation system at signalized intersections of the firm ... The specification proposed in this paper features the major differences with the previous attempt, which are threefold:作者: 標(biāo)準(zhǔn) 時間: 2025-3-27 05:04 作者: osculate 時間: 2025-3-27 07:40
https://doi.org/10.1007/978-3-319-31566-9We consider a model of the real time process algebra of [1,2,3] based on the nonstandard reals. As a subalgebra, we obtain a theory in which the urgent actions of ATP, TiCCS, TeCCS can be modeled.作者: 提名 時間: 2025-3-27 13:19
Mast Cell Disease (Urticaria Pigmentosa)Some properties of normed processes that belong both to BPP (Basic Parallel Processes) and to BPA (Basic Process Algebra) are established. Also, the intersection of normed BPP and λ(BPA) is examined. They are used to solve certain problems concerning decidability of bisimulation equivalence.作者: 脾氣暴躁的人 時間: 2025-3-27 15:57 作者: 提名的名單 時間: 2025-3-27 18:31
Real Time Process Algebra with Infinitesimals,We consider a model of the real time process algebra of [1,2,3] based on the nonstandard reals. As a subalgebra, we obtain a theory in which the urgent actions of ATP, TiCCS, TeCCS can be modeled.作者: 上漲 時間: 2025-3-27 22:43
Normed BPP and BPA,Some properties of normed processes that belong both to BPP (Basic Parallel Processes) and to BPA (Basic Process Algebra) are established. Also, the intersection of normed BPP and λ(BPA) is examined. They are used to solve certain problems concerning decidability of bisimulation equivalence.作者: 膠水 時間: 2025-3-28 03:06 作者: Induction 時間: 2025-3-28 07:40
Comparison of Deadlock Prevention Policies,cess algebras. An interpretation of CSP in the regular processes is presented. As an example of recursively defined processes, bag and stack are discussed in detail. It is shown that the bag cannot be recursively defined without merge..We introduce fixed point algebras which have interesting applica作者: maverick 時間: 2025-3-28 11:51 作者: COLIC 時間: 2025-3-28 16:49
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.作者: Coterminous 時間: 2025-3-28 19:07 作者: Infusion 時間: 2025-3-29 01:01
Optimal Liveness-Enforcing Supervisors,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作者: 格言 時間: 2025-3-29 06:26
David R. Crowe,Michael Morgan,Kara Trapp 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.作者: Myelin 時間: 2025-3-29 10:41
https://doi.org/10.1007/978-3-319-31566-9 that every recursively enumerable process graph is representable by a . expression. . in turn is expressible in aprACP (ACP with action prefixing instead of sequential composition)... established that both results crucially depend on the use of unguarded recursion, and its noncomputable consequence作者: 微塵 時間: 2025-3-29 12:52
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 defin作者: aerial 時間: 2025-3-29 18:48
Subcutaneous Panniculitis-like Lymphomaernative way of specifying an existing traffic regulation system at signalized intersections of the firm ... The specification proposed in this paper features the major differences with the previous attempt, which are threefold:作者: Libido 時間: 2025-3-29 21:30
https://doi.org/10.1007/978-0-387-68858-9n is written in the Process Specification Formalism (PSF). The actual implementation is made in an extension of the C language for concurrent programming. First we make an informal presentation and then we consider a formal approach.作者: 清楚 時間: 2025-3-29 23:55 作者: Insatiable 時間: 2025-3-30 04:09 作者: 表狀態(tài) 時間: 2025-3-30 12:04 作者: NIL 時間: 2025-3-30 14:04 作者: Pde5-Inhibitors 時間: 2025-3-30 18:38
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.作者: 偏狂癥 時間: 2025-3-31 00:43
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 時間: 2025-3-31 01:25
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 時間: 2025-3-31 07:18
,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.作者: 滔滔不絕的人 時間: 2025-3-31 12:46
