Titlebook: Mathematical Foundations of Computer Science 1989; Porabka-Kozubnik, Po Antoni Kreczmar,Grazyna Mirkowska Conference proceedings 1989 Sprin

方言

書目名稱Mathematical Foundations of Computer Science 1989影響因子(影響力)




書目名稱Mathematical Foundations of Computer Science 1989影響因子(影響力)學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 1989網(wǎng)絡(luò)公開度




書目名稱Mathematical Foundations of Computer Science 1989網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 1989被引頻次




書目名稱Mathematical Foundations of Computer Science 1989被引頻次學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 1989年度引用




書目名稱Mathematical Foundations of Computer Science 1989年度引用學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 1989讀者反饋




書目名稱Mathematical Foundations of Computer Science 1989讀者反饋學(xué)科排名

Conflict

A thesis for bounded concurrency,t components that communicate, synchronize, or otherwise cooperate. Comparisons involving succinctness and the time complexity of reasoning about programs have been undertaken. The results, which are extremely robust, show that in all the cases we have addressed bounded cooperative concurrency is of

savage

Space bounded computations : Review and new separation results,iques. We show that, for a slightly modified Turing machine model, the low level deterministic and nondeterministic space bounded complexity classes are different. Furthermore, for this computation model, we show that Savitch and Immerman-Szelepcsényi theorems do not hold in the range lg lg . to lg

separate

Correctness of concurrent processes,operators of CCS [Mi 80], CSP [Ho 85] and COSY [LTS 79] and logical formulas S specifying sets of finite communication sequences as in [Zw 89]. The definition of P . S is based on a Petri net semantics for process terms [Ol 89]. The main point is that P . S requires a simple liveness property of the

Harpoon

BILIO

Algebraically closed theories,hat most of the abstraction morphisms we are interested in don‘t commute with least fixed points. In order to offer an alternative to least fixed point semantics we present an axiomatization of the notion of fixed point calculus within the formalism of algebraic theories. Such a calculus fixes one s

thyroid-hormone

Control flow versus logic: A denotational and a declarative model for Guarded Horn Clauses,set of computed answer substitutions (the so-called success set) and the second one takes deadlock and infinite behaviour into account. They are easily related. The main purpose of the paper is to develop compositional models for GHC that are correct with respect to the operational models. For the s

DEAWL

搜尋

Optimal parallel algorithms for the recognition and colouring outerplanar graphs,ing a nontrivial class of graphs and it is the main result of the paper. If the graph is outerplanar and biconnected then a Hamiltonian cycle is produced. Using this cycle and optimal parsing algorithm for bracket expressions the construction of the tree of faces as well as vertex colourings (with t

旋轉(zhuǎn)一周