Titlebook: Mathematical Foundations of Computer Science 1996; 21st International S Wojciech Penczek,Andrzej Sza?as Conference proceedings 1996 Springe

你太謙虛

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




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




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




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




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




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




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




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




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




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

避開

Partial order reduction: Model-checking using representatives,the property to be checked. Applying the reduction constructs a reduced state-space that generates at least one representative for each equivalence class. This paper surveys some algorithms for partial order model-checking. The presentation focuses on the . approach. The reduction approach is extended to branching specifications.

Arthritis

Bisimilarity problems requiring exponential time (Extended abstract),is calculus and thus that exponential time is . in order to solve it. We then prove that, if we add a . operator to the calculus, and we impose that parallel composition is never used inside recursive definitions, then the bisimilarity problem is still EXP-complete, thus no harder than in the fragment without parallel composition.

Density

Conference proceedings 1996d 2 abstracts of invited talks. The papers included cover issues from the whole area of theoretical computer science, with a certain emphasis on mathematical and logical foundations. The 10 invited presentations are of particular value.

轉(zhuǎn)換

Flirtatious

A sequent calculus for subtyping polymorphic types,ive structures. The systems are complete with respect to this semantics. The logic which emerges from this paper can be seen as a successor to the original Hilbert style system proposed by J. Mitchell in 1988, and to the “half way” sequent calculus of G. Longo, K. Milsted and S. Soloviev proposed in 1995.

行乞

諂媚于人

Linear time temporal logics over Mazurkiewicz traces,eoretic methods for solving the satisfiability and model checking problems for these logics. It turns out that we still do not know what the “canonical” linear time temporal logic over Mazurkiewicz traces looks like. We identify here the criteria that should be met by this elusive logic.

態(tài)學(xué)

On the query complexity of sets,e important than Turing degree..We investigate when extra queries add power. We show that, for several nonrecursive sets ., the more queries you can ask, the more sets you can decide; however, there are sets for which more queries do not help at all.

無(wú)能的人

Shortest path problems with time constraints,d. Finally, we consider the general case where there is a vertex-dependent upper bound on the waiting time at each vertex. Several algorithms with pseudopolynomial time complexity are proposed to solve the problems. First we assume that all transit times . are positive integers. In the last section, we show how to include zero transit times.