大范围流行
发表于 2025-3-26 21:02:26
Mathematical Foundations of Computer Science 1997978-3-540-69547-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
值得
发表于 2025-3-27 03:50:33
http://reply.papertrans.cn/63/6262/626131/626131_32.png
我们的面粉
发表于 2025-3-27 08:50:34
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
发表于 2025-3-27 09:41:30
http://reply.papertrans.cn/63/6262/626131/626131_34.png
Arable
发表于 2025-3-27 16:10:42
http://reply.papertrans.cn/63/6262/626131/626131_35.png
有说服力
发表于 2025-3-27 19:52:47
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.
树木心
发表于 2025-3-27 22:28:22
http://reply.papertrans.cn/63/6262/626131/626131_37.png
enterprise
发表于 2025-3-28 04:47:47
http://reply.papertrans.cn/63/6262/626131/626131_38.png
散开
发表于 2025-3-28 07:54:57
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
发表于 2025-3-28 14:14:55
http://reply.papertrans.cn/63/6262/626131/626131_40.png