標(biāo)題: Titlebook: Automata, Languages and Programming; 18th International C Javier Leach Albert,Burkhard Monien,Mario Rodrígue Conference proceedings 1991 Sp [打印本頁] 作者: Interpolate 時間: 2025-3-21 20:04
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學(xué)科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學(xué)科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學(xué)科排名
作者: Oration 時間: 2025-3-21 22:51
Automata, Languages and Programming978-3-540-47516-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: GRILL 時間: 2025-3-22 00:45 作者: GRIN 時間: 2025-3-22 08:22 作者: 巨碩 時間: 2025-3-22 10:20
Statistics on random trees,In this paper we give a survey of the symbolic operator methods to do statistics on random trees. We present some examples and apply the techniques to find their asymptotic behaviour.作者: Malaise 時間: 2025-3-22 15:12
https://doi.org/10.1007/978-3-662-02122-4rational semantics, and are therefore useful for defining program equivalences and for semantics-based program analysis. The approach leads to the introduction of extended interpretations which are more expressive than Herbrand interpretations. The semantics in terms of extended interpretations can 作者: 格子架 時間: 2025-3-22 17:47 作者: 乏味 時間: 2025-3-22 21:58
Grundlagen der Schwing-Dreh-Bewegungen, performing simultaneously an extensional and a “stable” semantics in such a way that only maps existing in both semantics subsist in our model. The construction is carried out in the framework of strongly stable functions that we have recently defined and which is a refinement of stable semantics s作者: agglomerate 時間: 2025-3-23 04:36
Grundlagen der Schwing-Dreh-Bewegungen,ection for lazy list strictness analysis is not in general expressible as an abstract interpretation property of the standard semantics. We give circumstances when it is so expressible. Doing so casts light on Burn‘s .. projection and his question of its relationship to ...Uniform ideals are a gener作者: 調(diào)整校對 時間: 2025-3-23 06:14
Grundlagen der Schwing-Dreh-Bewegungen,e can lack a meaning in the sense that their outputs may be sensitive to the choice of input expression. We are, thus, naturally lead to a set-theoretic denotational semantics with partial functions. We set up a logic for reasoning about the definedness of terms and a deterministic and terminating e作者: Albumin 時間: 2025-3-23 11:30 作者: 未開化 時間: 2025-3-23 15:41
https://doi.org/10.1007/978-3-663-02500-9contributions of this paper include:.Modular termination proof systems that have been suggested before are defined for models with an unfair scheduler. The proof approach presented in them fails to be complete in a model with a fair scheduler. The main idea suggested here which allows for the develo作者: 極小 時間: 2025-3-23 18:11
https://doi.org/10.1007/978-3-662-32953-5la. This paper extends model-checking to stochastic real-time systems, whose behavior depends on probabilistic choice and quantitative time. The specification language is ., a branching-time temporal logic for expressing real-time properties. We interpret the formulas of the logic over generalized s作者: accordance 時間: 2025-3-23 23:12 作者: Isolate 時間: 2025-3-24 02:54 作者: 婚姻生活 時間: 2025-3-24 10:34
https://doi.org/10.1007/978-3-322-89717-6in theorem:.Every resolution of C(G) contains,at least, 2. distinct clauses..Applying it with Margulis graphs, we obtain an exponentially growing lower bound for the complexity of resolution. A similar result was obtained by A. Urquhart [Urq 87] with a different method valid only for a specific fami作者: intertwine 時間: 2025-3-24 13:36
https://doi.org/10.1007/978-3-642-50216-3rrency, which is an extension of the expansion theorem of CCS. The essential step made in this work is that a more general form of action prefix, . is introduced, where . is a time variable. Intuitively, . is an agent which may perform . and become . in doing so, where . is replaced by ., the time d作者: Interim 時間: 2025-3-24 15:00 作者: 舊石器 時間: 2025-3-24 19:13 作者: 沙文主義 時間: 2025-3-24 23:28 作者: 谷物 時間: 2025-3-25 04:05
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166203.jpg作者: 沉思的魚 時間: 2025-3-25 09:22 作者: 碎石 時間: 2025-3-25 11:49
Grundlagen der Schwing-Dreh-Bewegungen,ether programming and reasoning with the two presentations are equivalent. We formulate these questions, precisely, in the context of alternative presentations of the list, bag, and set datatypes and study some aspects of these questions. In particular, we establish back-and-forth translations betwe作者: 投射 時間: 2025-3-25 16:36
Konstruktion von Verstellgetrieben, generalized Kleene‘s theorem showing that the recognizable trace languages are exactly the co-rational languages. Besides, infinite traces have been recently introduced as a natural extension of both finite traces and infinite words. In this paper we generalize Kleene‘s theorem to languages of infi作者: 親愛 時間: 2025-3-25 21:10
Running time to recognize nonregular languages by 2-way probabilistic automata,作者: Bridle 時間: 2025-3-26 00:40
,On confluent semi-commutations — Decidability and complexity results,作者: 的闡明 時間: 2025-3-26 06:47
,Lazard’s factorizations of free partially commutative monoids,作者: 江湖騙子 時間: 2025-3-26 09:22
Javier Leach Albert,Burkhard Monien,Mario Rodrígue作者: Allege 時間: 2025-3-26 14:21 作者: 內(nèi)閣 時間: 2025-3-26 17:31
Logical and computational aspects of programming with sets/bags/lists,ether programming and reasoning with the two presentations are equivalent. We formulate these questions, precisely, in the context of alternative presentations of the list, bag, and set datatypes and study some aspects of these questions. In particular, we establish back-and-forth translations betwe作者: 率直 時間: 2025-3-27 00:30
A Kleene theorem for infinite trace languages, generalized Kleene‘s theorem showing that the recognizable trace languages are exactly the co-rational languages. Besides, infinite traces have been recently introduced as a natural extension of both finite traces and infinite words. In this paper we generalize Kleene‘s theorem to languages of infi作者: adj憂郁的 時間: 2025-3-27 01:30 作者: modish 時間: 2025-3-27 06:42
Logic programming with recurrence domains, certain recursive types. We present an extension of Horn logic programs, called ω-Prolog, which allows a finite schematization of infinitely many clauses via predicates with ω-terms as arguments. We show that for every ω-Prolog program there is an equivalent Horn logic program. That is, incorporati作者: Receive 時間: 2025-3-27 10:27
Extensional embedding of a strongly stable model of PCF, performing simultaneously an extensional and a “stable” semantics in such a way that only maps existing in both semantics subsist in our model. The construction is carried out in the framework of strongly stable functions that we have recently defined and which is a refinement of stable semantics s作者: mydriatic 時間: 2025-3-27 15:31
Uniform ideals and strictness analysis,ection for lazy list strictness analysis is not in general expressible as an abstract interpretation property of the standard semantics. We give circumstances when it is so expressible. Doing so casts light on Burn‘s .. projection and his question of its relationship to ...Uniform ideals are a gener作者: 縱火 時間: 2025-3-27 18:03
Logical and computational aspects of programming with sets/bags/lists,e can lack a meaning in the sense that their outputs may be sensitive to the choice of input expression. We are, thus, naturally lead to a set-theoretic denotational semantics with partial functions. We set up a logic for reasoning about the definedness of terms and a deterministic and terminating e作者: set598 時間: 2025-3-27 22:36
Safety for branching time semantics,rties using a .. Then, we consider the case of branching time semantics where a program is modeled by a set of infinite computation trees modulo bisimulation. We propose and study a safety preorder for this semantics based on simulation and dealing with silent actions. We focus on regular safety pro作者: Lipohypertrophy 時間: 2025-3-28 05:43
Program composition and modular verification,contributions of this paper include:.Modular termination proof systems that have been suggested before are defined for models with an unfair scheduler. The proof approach presented in them fails to be complete in a model with a fair scheduler. The main idea suggested here which allows for the develo作者: 有雜色 時間: 2025-3-28 09:38
Model-checking for probabilistic real-time systems,la. This paper extends model-checking to stochastic real-time systems, whose behavior depends on probabilistic choice and quantitative time. The specification language is ., a branching-time temporal logic for expressing real-time properties. We interpret the formulas of the logic over generalized s作者: FER 時間: 2025-3-28 13:29
Computing behavioural relations, logically, behavioral relations between processes. The algorithm‘s complexity is proportional to the product of the size of the process and the size of the formula, and thus improves on the best existing algorithm for such a fixed point logic. The method for computing preorders that the model checker induces 作者: 好忠告人 時間: 2025-3-28 18:24
The power of reconfiguration,network topologies and assuming several variants of the model. In particular, it is shown that there are reconfigurable machines based on simple network topologies, that are capable of solving large classes of problems in .. These classes depend on the kinds of switches assumed for the network nodes作者: BURSA 時間: 2025-3-28 22:37 作者: 翻布尋找 時間: 2025-3-29 02:46 作者: 聯(lián)想記憶 時間: 2025-3-29 04:49
A Kleene theorem for infinite trace languages,of recognizable languages is equal to the family of rational languages. It has been generalized in various ways, for instance, to formal power series by Schützenberger, to infinite words by Büchi and to finite traces by Ochmanski. Finite traces have been introduced by Mazurkiewicz in order to modeli作者: reaching 時間: 2025-3-29 08:28 作者: Glutinous 時間: 2025-3-29 15:11
On the semantics of logic programs,be obtained as a result of both an operational and a fixpoint construction. It can also be characterized from the modeltheoretic viewpoint, by defining a set of extended models which contains standard Herbrand models. The original construction for positive programs is shown to be applicable to other classes of logic programs, such as . and ..作者: 不幸的人 時間: 2025-3-29 18:40 作者: 純樸 時間: 2025-3-29 21:00 作者: 外面 時間: 2025-3-30 03:12 作者: Spina-Bifida 時間: 2025-3-30 06:59
0302-9743 ming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics.978-3-540-54233-9978-3-540-47516-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 博愛家 時間: 2025-3-30 11:54 作者: 疾馳 時間: 2025-3-30 12:59
Model-checking for probabilistic real-time systems,me Markov chains. The correctness of the algorithm is not obvious, because it analyzes the projection of a Markov process onto a finite state space. The projection process is not Markov, so our most significant result is that the model-checking algorithm works.作者: COWER 時間: 2025-3-30 18:44 作者: ALLEY 時間: 2025-3-30 22:55
Grundlagen der Schwing-Dreh-Bewegungen,ulation. We propose and study a safety preorder for this semantics based on simulation and dealing with silent actions. We focus on regular safety properties and characterize them by both tree-automata and formulas of a branching time logic. We show that verifying safety properties on trees reduces to simulation testing.作者: 創(chuàng)新 時間: 2025-3-31 04:01
https://doi.org/10.1007/978-3-663-02500-9. The proof approach presented in them fails to be complete in a model with a fair scheduler. The main idea suggested here which allows for the development of a modular and complete proof system for fair termination is a new program property, called ..
