Merge and Termination in Process Algebra
暂无分享,去创建一个
[1] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.
[2] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[3] Jan A. Bergstra,et al. Failures without chaos: a new process semantics for fair abstraction , 1987, Formal Description of Programming Concepts.
[4] Gordon Plotkin,et al. An Operational Semantics for CSP. , 1982 .
[5] Jan A. Bergstra,et al. Top-Down Design and the Algebra of Communicating Processes , 1985, Sci. Comput. Program..
[6] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[7] Rob J. van Glabbeek,et al. Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra , 1987, STACS.
[8] C. A. R. Hoare,et al. Notes on Communicating Sequential Systems , 1986 .
[9] Jan A. Bergstra,et al. Process Algebra for Synchronous Communication , 1984, Inf. Control..