標題: Titlebook: Structures in Concurrency Theory; Proceedings of the I J?rg Desel Conference proceedings 1995 British Computer Society 1995 algebra.calculu [打印本頁] 作者: foresight 時間: 2025-3-21 19:27
書目名稱Structures in Concurrency Theory影響因子(影響力)
書目名稱Structures in Concurrency Theory影響因子(影響力)學(xué)科排名
書目名稱Structures in Concurrency Theory網(wǎng)絡(luò)公開度
書目名稱Structures in Concurrency Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Structures in Concurrency Theory被引頻次
書目名稱Structures in Concurrency Theory被引頻次學(xué)科排名
書目名稱Structures in Concurrency Theory年度引用
書目名稱Structures in Concurrency Theory年度引用學(xué)科排名
書目名稱Structures in Concurrency Theory讀者反饋
書目名稱Structures in Concurrency Theory讀者反饋學(xué)科排名
作者: 怒目而視 時間: 2025-3-21 20:42
https://doi.org/10.1007/978-1-4471-3078-9algebra; calculus; concurrency; recursion作者: 沒花的是打擾 時間: 2025-3-22 04:22 作者: 內(nèi)部 時間: 2025-3-22 06:31 作者: ellagic-acid 時間: 2025-3-22 11:28 作者: 共和國 時間: 2025-3-22 13:21
The Three Dimensions of Semantics,In Semantics, one studies functions .: . → ., mapping the language . to a semantic domain .. We provide an overview of recent progress along the axes作者: exhilaration 時間: 2025-3-22 20:27
CALIBAN - Esprit Basic Research WG 6067,This paper describes the results of the Esprit Basic Research Working Group 6067 CALIBAN (Causal Calculi Based on Nets).作者: 變量 時間: 2025-3-23 00:58
Refinement and Recursion in a High Level Petri Box Calculus,The algebra of A-nets, a high level class of labelled Petri nets introduced in the Petri Box Calculus in order to cope with structured data, is extended with a general refinement operator and, based thereon, a general recursion operator; their properties may directly be derived from the corresponding operators for the low level Petri Boxes.作者: PANEL 時間: 2025-3-23 03:32
ases, including systems having priority, developments lead to procedures or formulae that yield numerical results from which sensitivity of queueing behavior to parameter variation can be explored.? In several cases multiple approaches to computing distributions are presented...Queueing Theory with 作者: Ophthalmoscope 時間: 2025-3-23 07:30
Eike Best,Raymond Devillers,Elisabeth Pelz,Arend Rensink,Manuel Silva,Enrique Teruelases, including systems having priority, developments lead to procedures or formulae that yield numerical results from which sensitivity of queueing behavior to parameter variation can be explored.? In several cases multiple approaches to computing distributions are presented...Queueing Theory with 作者: 大范圍流行 時間: 2025-3-23 12:02 作者: 議程 時間: 2025-3-23 17:50
S. Arun-Kumar,V. Natarajanases, including systems having priority, developments lead to procedures or formulae that yield numerical results from which sensitivity of queueing behavior to parameter variation can be explored.? In several cases multiple approaches to computing distributions are presented...Queueing Theory with 作者: Individual 時間: 2025-3-23 19:07 作者: 考古學(xué) 時間: 2025-3-24 00:57 作者: 寒冷 時間: 2025-3-24 05:44
Luca Bernardinello,Giorgio De Michelis,Katia Petruni,Sebastiano Vignariority, developments lead to procedures or formulae that yield numerical results from which sensitivity of queueing behavior to parameter variation can be explored.? In several cases multiple approaches to computing distributions are presented...Queueing Theory with 978-1-4419-3563-2978-0-387-22859-4作者: antiandrogen 時間: 2025-3-24 08:25
Eike Best,Hans Fleischhack,Wojciech Fraczak,Richard P. Hopkins,Hanna Klaudel,Elisabeth Pelzriority, developments lead to procedures or formulae that yield numerical results from which sensitivity of queueing behavior to parameter variation can be explored.? In several cases multiple approaches to computing distributions are presented...Queueing Theory with 978-1-4419-3563-2978-0-387-22859-4作者: 不滿分子 時間: 2025-3-24 12:04
I. Biermann,B. Rozoyriority, developments lead to procedures or formulae that yield numerical results from which sensitivity of queueing behavior to parameter variation can be explored.? In several cases multiple approaches to computing distributions are presented...Queueing Theory with 978-1-4419-3563-2978-0-387-22859-4作者: fleeting 時間: 2025-3-24 16:33 作者: right-atrium 時間: 2025-3-24 19:50 作者: Detain 時間: 2025-3-25 01:40 作者: preservative 時間: 2025-3-25 06:54
1431-1682 Germany. It includes three invited contributions - by J. de Bakker, E. Best et aI, and E. R. Olderog and M. Schenke - and all papers which were submitted and accepted for presentation. Concurrency Theory deals with formal aspects of concurrent systems. It uses partly competing and partly complementa作者: 禮節(jié) 時間: 2025-3-25 09:43 作者: 發(fā)酵劑 時間: 2025-3-25 15:05
Design of Real-Time Systems: Interface between Duration Calculus and Program Specifications,ile Duration Calculus is state-based, SL is event-based and can be seen as a stepping stone towards a timed OCCam-like programming language. The approach is illustrated by the example of a computer controlled gas burner.作者: 厚顏無恥 時間: 2025-3-25 16:33
Graphs for Generalized Traces,graph induced by the partial ordering of symbol occurrences. We point out differences and exhibit necessary and/or sufficient conditions for them to be isomorphic: this is settled with the help of diamond properties.作者: relieve 時間: 2025-3-25 20:10 作者: 加強防衛(wèi) 時間: 2025-3-26 01:34
Message passing mutex,buted algorithms. The verification rules allow for rigorous reasoning close to the arguments of an informal proof..The verification method is applied to the new solution as well as to Peterson’s solution. This allows for a comparison of the two algorithms.作者: Collision 時間: 2025-3-26 04:55
Metric completion versus ideal completion,. Starting with a semantic domain . for ‘finite behaviour’ we investigate the relation between the ideal completion .(.) and the metric completion which are both suitable to model recursion and infinite behaviour. We also consider the properties of semantic operators.作者: 不理會 時間: 2025-3-26 12:08 作者: 燈泡 時間: 2025-3-26 15:10 作者: 外表讀作 時間: 2025-3-26 19:49
Orbits, half-frozen tokens and the liveness of weighted circuits,nd a live marking with the same weight. Different orbits are also associated with the presence of a kind of frozen tokens, which we call .. A discussion of problems associated with deter-mining liveness for weighted circuits follows and an arithmetical condition to determine whether a given marking is live is presented.作者: 不合 時間: 2025-3-26 21:03
An Observational Semantics for Linda,ramework of process algebras. A two-level semantics for L is provided: an operational one in Plotkin’s style, based on a ., and an observational one, based on three ., obtained by applying the . to L.作者: 宮殿般 時間: 2025-3-27 02:08 作者: 承認 時間: 2025-3-27 06:44 作者: Ingrained 時間: 2025-3-27 10:15
Conformance: A Precongruence close to Bisimilarity,he elaboration preorder, which is finer than observational equivalence. Further, this preorder is incomparable with the almost-weak bisimulation preorder of Sangiorgi and Milner. In particular, the elaboration preorder is preserved under all contexts except summation. The largest precongruence conta作者: Exonerate 時間: 2025-3-27 14:53 作者: comely 時間: 2025-3-27 18:40 作者: 拍翅 時間: 2025-3-28 00:40 作者: Heart-Attack 時間: 2025-3-28 03:42 作者: AGONY 時間: 2025-3-28 07:35
An Observational Semantics for Linda, data space. To write programs manipulating data, it is necessary to embed Linda in a (functional, imperative, logic, etc.) programming language; this leads to a family of languages based on Linda. We define syntax and semantics for a member of the Linda family, L, that is obtained by embedding Lind作者: orthodox 時間: 2025-3-28 13:47 作者: WAG 時間: 2025-3-28 17:44
Linear Space Algorithm for On-line Detection of Global Predicates, and Marzullo defined this problem as .(Φ)..This paper presents the first on-line algorithm using linear space which solves this problem in the general case, improving all existing algorithms both in time and space. It is particularly interesting for the detection of .(Φ) on potentially infinite com作者: refine 時間: 2025-3-28 19:43
A Simple Decision Method for the Linear Time Mu-calculus,ether a given .-formula is satisfiable, and give a direct proof of its completeness. Although simpler than the existing methods, it gives rise to an algorithm working in the same 2.(....) time as these, or alternatively, to a polynomial space, singly exponential time algorithm. What is more importan作者: 喚醒 時間: 2025-3-29 00:14 作者: 使高興 時間: 2025-3-29 03:54 作者: 假裝是我 時間: 2025-3-29 08:02
Metric completion versus ideal completion,cker [4] proposed a metric setting for handling concurrency, recursion and nontermination, which has proved to be very successful in many applications. Starting with a semantic domain . for ‘finite behaviour’ we investigate the relation between the ideal completion .(.) and the metric completion whi作者: 運動性 時間: 2025-3-29 14:12 作者: 觀點 時間: 2025-3-29 17:23 作者: Diaphragm 時間: 2025-3-29 23:30 作者: BROTH 時間: 2025-3-30 02:03
Conformance: A Precongruence close to Bisimilarity,ined in it, which we call conformance, is obtained by the usual means and a complete axiomatization for conformance of finite processes is given. The paper ends with an example to show the use of this relation.作者: 食道 時間: 2025-3-30 05:22
On The Synchronic Structure of Transition Systems,stance measuring their degree of synchronization. In this paper we show that a natural generalization of regions introduced by Ehrenfeucht and Rozenberg exactly corresponds to synchronic distances and that this notion of region can be used to axiomatise a class of transition systems corresponding to bounded place/transition nets without loops.作者: 共同生活 時間: 2025-3-30 10:08 作者: Hangar 時間: 2025-3-30 12:24 作者: circumvent 時間: 2025-3-30 18:07 作者: 斷言 時間: 2025-3-30 23:13
J. W. de Bakkerns to Packet Telecommunication. is an efficient introduction to fundamental concepts and principles underlying the behavior of queueing systems and its application to the design of packet-oriented electrical communication systems. In addition to techniques and approaches found in earlier works, the 作者: 盟軍 時間: 2025-3-31 04:17
Eike Best,Raymond Devillers,Elisabeth Pelz,Arend Rensink,Manuel Silva,Enrique Teruelavior of queueing systems and its application to the design of packet-oriented electrical communication systems. In addition to techniques and approaches found in earlier works, the author presents a thoroughly modern computational approach based on Schur decomposition. This approach facilitates sol作者: puzzle 時間: 2025-3-31 05:15
E.-R. Olderog,M. Schenkeavior of queueing systems and its application to the design of packet-oriented electrical communication systems. In addition to techniques and approaches found in earlier works, the author presents a thoroughly modern computational approach based on Schur decomposition. This approach facilitates sol作者: 小溪 時間: 2025-3-31 12:09
S. Arun-Kumar,V. Natarajanavior of queueing systems and its application to the design of packet-oriented electrical communication systems. In addition to techniques and approaches found in earlier works, the author presents a thoroughly modern computational approach based on Schur decomposition. This approach facilitates sol作者: 和平主義 時間: 2025-3-31 16:09
Luca Bernardinello,Giorgio De Michelis,Katia Petruni,Sebastiano Vignans to Packet Telecommunication. is an efficient introduction to fundamental concepts and principles underlying the behavior of queueing systems and its application to the design of packet-oriented electrical communication systems. In addition to techniques and approaches found in earlier works, the 作者: UTTER 時間: 2025-3-31 18:06 作者: 妨礙 時間: 2025-3-31 23:45 作者: 認識 時間: 2025-4-1 01:52
