標題: Titlebook: CAAP ‘90; 15th Colloquium on T A. Arnold Conference proceedings 1990 Springer-Verlag Berlin Heidelberg 1990 algebra.algorithm.algorithms.co [打印本頁] 作者: 可怖 時間: 2025-3-21 16:11
書目名稱CAAP ‘90影響因子(影響力)
書目名稱CAAP ‘90影響因子(影響力)學科排名
書目名稱CAAP ‘90網(wǎng)絡公開度
書目名稱CAAP ‘90網(wǎng)絡公開度學科排名
書目名稱CAAP ‘90被引頻次
書目名稱CAAP ‘90被引頻次學科排名
書目名稱CAAP ‘90年度引用
書目名稱CAAP ‘90年度引用學科排名
書目名稱CAAP ‘90讀者反饋
書目名稱CAAP ‘90讀者反饋學科排名
作者: 稀釋前 時間: 2025-3-21 21:55
A markovian concurrency measure,We extend the measure introduced in . to a probabilistic one, by means of a natural translation of the synchronized automata of Arnold-Nivat‘s model to Markov chains: the computation of the measure uses the concept of average time before absorbtion. Some examples including the mutual exclusion are detailed.作者: Axon895 時間: 2025-3-22 02:08
Measurement of Soil Water Content,We consider the following problem:.: a finite alphabet A, a biprefix code X={x,y} whose elements are primitive, weA*..: find every maximal factors of w which are prefixes of a word of X*..We present an algorithm which solves the problem in time linear of the length of w, after a preprocessing phase applied to the set X.作者: 一再遛 時間: 2025-3-22 08:37
Measurement of Soil Water Content,The chief purpose of this paper is to appraise the feasibility of Girard‘s linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear logic in Petri nets, with respect to which we investigate the expressive power of the logic.作者: PON 時間: 2025-3-22 09:49 作者: 焦慮 時間: 2025-3-22 15:09 作者: 焦慮 時間: 2025-3-22 18:43 作者: 冷淡一切 時間: 2025-3-22 21:44
A Framework of Microtectonic Studies,ariables, l-variables. Powerful compilation techniques, i.e. translation to combinatory logic, and implementation techniques such as reduction machines, have shown how to overcome this problem in the context of functional languages. The paper addresses a similar approach to equational logic programm作者: ascetic 時間: 2025-3-23 02:35
G. Kompa,M. Schlechtweg,F. van Raayransition systems — here called graphical specifications — and Hennessy-Milner Logic. We show that any graphical specification may be expressed by a logical specification having the same models. Conversely, we give a characterization of the formulae that are graphically representable.作者: 博愛家 時間: 2025-3-23 08:50 作者: 閑聊 時間: 2025-3-23 09:49 作者: buoyant 時間: 2025-3-23 15:08
https://doi.org/10.1007/1-4020-3288-9ses: different typing proofs of the same term must have related meanings. We propose a proof-theoretical, rewriting approach to this problem. We focus on F≤, a second order lambda calculus with bounded quantification, which is rich enough to make the problem interesting. We define a normalizing rewr作者: Proclaim 時間: 2025-3-23 21:31 作者: follicle 時間: 2025-3-24 00:40 作者: 合唱隊 時間: 2025-3-24 05:07
Measurement of Soil Water Content,together with the known exponential-time algorithm that solves the problem, yields the DEXPTIME-completeness result. This settles an open problem of P. Kanellakis and J.C. Mitchell..Part of our analysis is an algebraic characterization of ML typability in terms of a restricted form of semi-unificati作者: GNAW 時間: 2025-3-24 08:54
Fabry-Perot-Type Microwave Resonators, ss) of it for which ts and ss are distinct, is reducible. Inductive (co)-reducibility has been proved to be the fundamental tool for mechanizing inductive proofs, together with Knuth-Bendix completion (Jouannaud and Kounalis [JK, 86 and 89])..In [JK, 86 and 89] an algorithm for testing inductive 作者: 步兵 時間: 2025-3-24 13:59
Microwave-assisted Heterocyclic Chemistry,lace in a triangle in a 2-dimensional lattice space with two reflecting barriers along the axes (a deletion takes no effect on an empty stack) and one absorbing barrier parallel to the second diagonal (the algorithm stops when the combined sizes of the stacks exhaust the available storage)..For (ii)作者: Confound 時間: 2025-3-24 18:25
Modeling of the Time-Dependent Wave Equationed, and it is shown that both a . and a . value assignment exist. We give two different characterizations of . value assignments: In terms of the . that describe them as subsets of the maximal values, and in terms of .. As an application we introduce rational infinite values in our system. Programs 作者: 能量守恒 時間: 2025-3-24 19:05 作者: Paradox 時間: 2025-3-25 00:16 作者: 名字 時間: 2025-3-25 06:54
G. Kompa,M. Schlechtweg,F. van Raayransition systems — here called graphical specifications — and Hennessy-Milner Logic. We show that any graphical specification may be expressed by a logical specification having the same models. Conversely, we give a characterization of the formulae that are graphically representable.作者: pulmonary-edema 時間: 2025-3-25 11:20 作者: FLUSH 時間: 2025-3-25 13:02
https://doi.org/10.1007/3-540-52590-4algebra; algorithm; algorithms; complexity; data structure; data structures; formal language; formal specif作者: HERTZ 時間: 2025-3-25 18:10
978-3-540-52590-5Springer-Verlag Berlin Heidelberg 1990作者: 羊齒 時間: 2025-3-25 23:23 作者: Embolic-Stroke 時間: 2025-3-26 02:24 作者: GUILT 時間: 2025-3-26 06:51
Towards the unification of models for concurrency,inal universal properties in the sub categories induced by such morphisms. In order to model the truly concurrent aspect of CCS, we write axioms which identify computations obtained by permuting independent transitions. By unfolding the resulting transition system, we obtain the domain of configurat作者: 易于出錯 時間: 2025-3-26 10:56 作者: construct 時間: 2025-3-26 16:34 作者: nuclear-tests 時間: 2025-3-26 16:49
Fabry-Perot-Type Microwave Resonatorndran, and Zhang‘s algorithms amount to intractable computation, even in very simple cases..We present here a new algorithm for the general case which outperforms Plaisted‘s and Kapur, Narendran and Zhang‘s algorithms and even our previous algorithm in case of a left-linear term rewriting system. We作者: pineal-gland 時間: 2025-3-27 00:31 作者: Handedness 時間: 2025-3-27 03:25 作者: 細節(jié) 時間: 2025-3-27 08:29
0302-9743 ch results and cover the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered as that of sets of discrete structures and the theory of rewriting systems over these objects. - App作者: 拘留 時間: 2025-3-27 12:25 作者: hieroglyphic 時間: 2025-3-27 15:21 作者: Discrete 時間: 2025-3-27 20:40
Modeling of the Time-Dependent Wave Equationat describe them as subsets of the maximal values, and in terms of .. As an application we introduce rational infinite values in our system. Programs can then work on infinite imperative data structures which are allocated lazily during execution.作者: keloid 時間: 2025-3-28 01:01
Combinatory forms for equational programming: Instances, unification and narrowing,s, have shown how to overcome this problem in the context of functional languages. The paper addresses a similar approach to equational logic programming: equations are translated into variable-free combinations and correspondingly narrowing is reformulated in terms of a set of reduction rules.作者: 有權威 時間: 2025-3-28 05:05 作者: CHARM 時間: 2025-3-28 10:15
Infinite values in hierarchical imperative types,at describe them as subsets of the maximal values, and in terms of .. As an application we introduce rational infinite values in our system. Programs can then work on infinite imperative data structures which are allocated lazily during execution.作者: 范圍廣 時間: 2025-3-28 10:32 作者: 凝視 時間: 2025-3-28 17:01
On the power of bounded concurrency II: The pushdown automata level,ower, in both upper and lower bound senses, regardless of whether or not the two former features are also present. While we use the language of statecharts to capture these features, our results are extremely robust, and hold also for bounded versions of virtually all other concurrent languages.作者: Ovulation 時間: 2025-3-28 21:29 作者: 勾引 時間: 2025-3-29 02:54
Equivalence of finite-valued bottom-up finite state tree transducers is decidable,ded it is finite. We decompose a finite-valued FST A into a finite number of single-valued FST‘s. This enables us to prove: it is decidable whether or not the translation of an FST A is included in the translation of a finite-valued FST A‘.作者: PLUMP 時間: 2025-3-29 05:55 作者: 骨 時間: 2025-3-29 10:45
Conference proceedings 1990 and cover the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered as that of sets of discrete structures and the theory of rewriting systems over these objects. - Application o作者: Fibrin 時間: 2025-3-29 14:46 作者: 新義 時間: 2025-3-29 18:28 作者: 壓倒 時間: 2025-3-29 23:02 作者: restrain 時間: 2025-3-30 01:44
Microwave-assisted Heterocyclic Chemistry,et [7] with different tools. We provide here an analysis of the general case with new limiting distributions. At our knowledge such kind of analysis has never been done before for the banker algorithm.作者: Apraxia 時間: 2025-3-30 06:52
A unified approach for showing language containment and equivalence between various types of ,-autoh the formulas obtained from the automata. The results of our paper are important for verification of finite state concurrent systems with fairness constraints. A natural way of reasoning about such systems is to model the finite state program by one .-automaton and its specification by another.作者: Deduct 時間: 2025-3-30 10:46
Coherence of subsumption,e terms of an auxiliary type system, in which the terms carry a complete information about their typing proof. This technique gives also a simple proof of the existence of a minimum type for each term. From an analysis of the proofs in normal form we obtain a deterministic type-checking algorithm, which is sound and complete by construction.作者: 認為 時間: 2025-3-30 14:36
Probabilistic analysis of some distributed algorithms,et [7] with different tools. We provide here an analysis of the general case with new limiting distributions. At our knowledge such kind of analysis has never been done before for the banker algorithm.作者: 同音 時間: 2025-3-30 20:29
On the power of bounded concurrency II: The pushdown automata level,of states that cooperate in accepting the input. In this paper we deal with the level of pushdown automata. We are interested in differencies in power of expression and in discrepencies in succinctness between variants of pda‘s that incorporate nondeterminism, pure parallelism and bounded cooperativ作者: PLAYS 時間: 2025-3-30 23:18 作者: flamboyant 時間: 2025-3-31 04:16
Graphical versus logical specifications,ransition systems — here called graphical specifications — and Hennessy-Milner Logic. We show that any graphical specification may be expressed by a logical specification having the same models. Conversely, we give a characterization of the formulae that are graphically representable.作者: 有說服力 時間: 2025-3-31 08:29 作者: Dedication 時間: 2025-3-31 11:36 作者: stroke 時間: 2025-3-31 17:24
Coherence of subsumption,ses: different typing proofs of the same term must have related meanings. We propose a proof-theoretical, rewriting approach to this problem. We focus on F≤, a second order lambda calculus with bounded quantification, which is rich enough to make the problem interesting. We define a normalizing rewr
