We present an extension to the Murϕ verifier to verify systems with replicated identical components. Verification is by explicit state enumeration in an abstract state space where states do not record the exact numbers of components. Through a new datatype, called Repetitive lD, the user can suggest the use of such an abstraction to verify a system of fixed size. Murϕ automatically checks the soundness of the abstract state graph, and automatically constructs the abstract state graph using the system description. Using a simple run time check, Murϕ can also determine if it can generalize the verification result of a system with fixed size to systems of larger sizes, including the system with infinite number of components.
CITATION STYLE
Norris Ip, C., & Dill, D. L. (1996). Verifying systems with replicated components in Murϕ. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1102, pp. 147–158). Springer Verlag. https://doi.org/10.1007/3-540-61474-5_65
Mendeley helps you to discover research relevant for your work.