( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement.

, и . EXPRESS, том 27 из Electronic Notes in Theoretical Computer Science, стр. 107-126. Elsevier, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Roberto Cattaneo

Roberto Ohrt

Roberto Castello

Roberto Klimmek

Roberto Menegazzo

 

Другие публикации лиц с тем же именем

Computing Surveys' Electronic Symposium on the Theory of Computation., , , и . ACM Comput. Surv., 31 (3): 223-226 (1999)Obituary, Nadia Busi (1968-2007).. Bulletin of the EATCS, (2007)Implicative Formulae in the "Proofs as Computations" Analogy., , и . POPL, стр. 59-71. ACM Press, (1990)Information Flow Analysis in a Discrete-Time Process Algebra., , и . CSFW, стр. 170-184. IEEE Computer Society, (2000)Temporary Data in Shared Dataspace Coordination Languages., , и . FoSSaCS, том 2030 из Lecture Notes in Computer Science, стр. 121-136. Springer, (2001)An Exercise in Concurrency: a CSP Process as a Condition/ event System., , и . European Workshop on Applications and Theory of Petri Nets, том 340 из Lecture Notes in Computer Science, стр. 85-105. Springer, (1987)Process Calculi for Coordination: From Linda to JavaSpaces., , и . AMAST, том 1816 из Lecture Notes in Computer Science, стр. 198-212. Springer, (2000)A Process Algebraic View of Linda Coordination Primitives., , и . Theor. Comput. Sci., 192 (2): 167-199 (1998)CCS(25, 12) is Turing-complete.. Fundam. Informaticae, 154 (1-4): 145-166 (2017)Process Algebras for Petri Nets - The Alphabetization of Distributed Systems. Monographs in Theoretical Computer Science. An EATCS Series Springer, (2017)