A Process Algebraic Approach to Fault-Tolerance
暂无分享,去创建一个
[1] Luca Aceto,et al. Termination, Deadlock and Divergence , 1989, Mathematical Foundations of Programming Semantics.
[2] Robin Milner,et al. Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..
[3] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[4] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[5] Luigi V. Mancini,et al. Towards a Theory of Replicated Processing , 1988, FTRTFT.
[6] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[7] Michael J. Fischer,et al. Reasoning about Uncertainty in Fault-tolerant Distributed Systems , 1988, FTRTFT.
[8] Kim S. Larsen,et al. Fully abstract models for a process language with refinement , 1988, REX Workshop.
[9] Algirdas Avizienis,et al. The N-Version Approach to Fault-Tolerant Software , 1985, IEEE Transactions on Software Engineering.
[10] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[11] Jan A. Bergstra,et al. Process theory based on bisimulation semantics , 1988, REX Workshop.
[12] Flaviu Cristian,et al. Understanding fault-tolerant distributed systems , 1991, CACM.
[13] Ursula Goltz,et al. Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.
[14] Bernhard Steffen,et al. Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.
[15] Roberto Gorrieri,et al. A²CCS: A Simple Extension of CCS for Handling Atomic Actions , 1988, CAAP.