A Comparison of Simulation Techniques and Algebraic Techniques for Verifying Concurrent Systems
Name
MIT-LCS-TM-499.pdf
Size
3.1 MB
Format
Adobe PDF
Checksum (MD5)
5f3ed59c85a3b6a4f5a337f339dfba24
Author(s)
Lynch, Nancy A.
Segala, Roberto
Date Issued
November 1993
Series/Report no.
MIT-LCS-TM-499
Abstract
Simulation-based assertional techniques and process algebraic techniques are two of the major methods that have been proposed for the verification of concurrent and distributed systems. It is shown how each of these techniques can be applied to the task of verifying systems described as input/output automata; both of these ways, first using forward simulations, an execution correspondence lemma, and a simple fairness argument, and second using deductions within the process algebra DIOA for I/O automata. An extended evaluation and comparison of the two methods is given.
Persistent DSpace Link
