Proved Trees
暂无分享,去创建一个
[1] Ugo Montanari,et al. Partial ordering derivations for CCS , 1985, FCT.
[2] Ugo Montanari,et al. An Algebraic View of Interleaving and Distributed Operational Semantics for CCS , 1989, Category Theory and Computer Science.
[3] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[4] Ugo Montanari,et al. On the operational semantics of distributed concurrent systems , 1988 .
[5] Rocco De Nicola,et al. Partial orderings descriptions and observations of nondeterministic concurrent processes , 1988, REX Workshop.
[6] Gian Luigi Ferrari,et al. Towards the Unification of Models for Concurrency , 1990, CAAP.
[7] Gérard Boudol,et al. Algèbre de Processus et Synchronisation , 1984, Theor. Comput. Sci..
[8] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[9] Rocco De Nicola,et al. A Partial Ordering Semantics for CCS , 1990, Theor. Comput. Sci..
[10] Roberto Gorrieri,et al. An Extended Expansion Theorem , 1991, TAPSOFT, Vol.2.
[11] Jan A. Bergstra,et al. Process Algebra for Synchronous Communication , 1984, Inf. Control..
[12] C. A. R. Hoare,et al. A Theory of Communicating Sequential Processes , 1984, JACM.
[13] Ugo Montanari,et al. Concurrent Histories: A Basis for Observing Distributed Systems , 1987, J. Comput. Syst. Sci..
[14] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[15] Ilaria Castellani,et al. A non-interleaving semantics for CCS based on proved transitions , 1988 .