Verifying Fault Tolerance of Distributed Algorithms Formally - An Example
暂无分享,去创建一个
[1] Nancy A. Lynch,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[2] Miroslaw Malek,et al. The consensus problem in fault-tolerant computing , 1993, CSUR.
[3] Sudhakar M. Reddy,et al. Distributed fault-tolerance for large multiprocessor systems , 1980, ISCA '80.
[4] Leslie Lamport,et al. The temporal logic of actions , 1994, TOPL.
[5] Eike Best,et al. PEP - More than a Petri Net Tool , 1996, TACAS.
[6] Martín Abadi. An Axiomatization of Lamport's Temporal Logic of Actions , 1990, CONCUR.
[7] Jörg Desel,et al. How Distributed Algorithms Play the Token Game , 1997, Foundations of Computer Science: Potential - Theory - Cognition.
[8] Hans-Michael Hanisch. Analysis of Place/Transition Nets with Timed Arcs and its Application to Batch Process Control , 1993, Application and Theory of Petri Nets.
[9] Wolfgang Reisig,et al. Modelling and Verification of Distributed Algorithms , 1996, CONCUR.
[10] Professor Dr. Wolfgang Reisig. Elements of Distributed Algorithms , 1998, Springer Berlin Heidelberg.
[11] GERNOT METZE,et al. On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..
[12] Wolfgang Reisig,et al. Petri Net Models of Distributed Algorithms , 1995, Computer Science Today.
[13] Lalit M. Patnaik,et al. Fault-tolerance analysis of hypercube systems using Petri net theory , 1993, J. Syst. Softw..
[14] Nancy A. Lynch,et al. An introduction to input/output automata , 1989 .
[15] P. J. Veerkamp. On the development of an artifact and design description language , 1990 .
[16] Natarajan Shankar,et al. Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS , 1995, IEEE Trans. Software Eng..
[17] Ekkart Kindler,et al. Message passing mutex , 1995, STRICT.