Titlebook: Mathematical Foundations of Computer Science 1997; 22nd International S Igor Prívara,Peter Ru?i?ka Conference proceedings 1997 Springer-Ver

大范圍流行

Mathematical Foundations of Computer Science 1997978-3-540-69547-9Series ISSN 0302-9743 Series E-ISSN 1611-3349

值得

我們的面粉

Communication complexity and sequential computation, focuses on the relation between communication complexity and the following three complexity measures of sequential computation:.We present a survey of the known relations between communication complexity and these three problem areas and formulate several open problems for further research.

perimenopause

Arable

有說(shuō)服力

A category of transition systems and its relations with orthomodular posets, calculus of regions, according to Ehrenfeucht and Rozenberg. The functor from PCOS to LETS defines a procedure which builds a labelled transition system, given an abstract set of regions with their order relation. We show that the two functors form an adjunction.

樹(shù)木心

enterprise

散開(kāi)

Specifying computations using hyper transition systems,e equivalent to the standard weakest precondition semantics. Finally, we propose a refinement relation that preserves the atomic step of a computation and generalizes the simulation relation on ordinary transition systems. This can be used to augment specification languages with a form of concurrency.

Fulminate