Notes on the Methodology of CCS and CSP
暂无分享,去创建一个
[1] J. W. de Bakker,et al. Processes and the Denotational Semantics of Concurrency , 1982, Inf. Control..
[2] Jan A. Bergstra,et al. Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .
[3] Jan A. Bergstra,et al. Algebra of Communicating Processes , 1995, Workshops in Computing.
[4] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[5] M Martin Rem,et al. Partially ordered computations, with applications to VLSI-design , 1983, FOCS 1983.
[6] J. W. de Bakker,et al. Denotational semantics of concurrency , 1982, STOC '82.
[7] C. A. R. Hoare,et al. A Theory of Communicating Sequential Processes , 1984, JACM.
[8] S C Kleene,et al. Representation of Events in Nerve Nets and Finite Automata , 1951 .
[9] Rocco De Nicola,et al. A Complete Set of Axioms for a Theory of Communicating Sequential Processes , 1983, FCT.
[10] Jan A. Bergstra,et al. Failures without chaos: a new process semantics for fair abstraction , 1987, Formal Description of Programming Concepts.
[11] Stephen D. Brookes,et al. On the Relationship of CCS and CSP , 1983, ICALP.
[12] Arto Salomaa,et al. Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.
[13] Robin Milner,et al. Lectures on a Calculus for Communicating Systems , 1984, Seminar on Concurrency.
[14] Jan A. Bergstra,et al. Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator , 1987, Comput. J..
[15] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.