Titlebook: CONCUR ‘98 Concurrency Theory; 9th International Co Davide Sangiorgi,Robert Simone Conference proceedings 1998 Springer-Verlag Berlin Heide

epicardium

背信

cortisol

Synthesis from knowledge-based specifications,can refer to the uncertainty the program has about the environment‘s behavior. In this work we solve the problem of synthesis with incomplete information with respect to specifications in the logic of knowledge and time. We show that the problem has the same worst-case complexity as synthesis with complete information.

反叛者

间谍活动

惰性女人

出生

From rewrite to bisimulation congruences,nces. As a test of the theory it is shown that bisimulation for a fragment of CCS is recovered. The transitions generated for a fragment of the Ambient Calculus of Cardelli and Gordon, and for SKI combinators, are also discussed briefly.

refine

影响

adj忧郁的

Nicolas Guéguen,Sébastien Meinerirequivalence and adding so called tau-laws. These are similar to the well known tau-laws for CCS and the π-calculus, but there is an interesting difference which highlights an aspect of the higher expressive power of the fusion calculus.