TY - JOUR
T1 - On the complexity of verifying concurrent transition systems
AU - Harel, David
AU - Kupferman, Orna
AU - Vardi, Moshe Y.
PY - 2002/3/15
Y1 - 2002/3/15
N2 - In implementation verification, we check that an implementation is correct with respect to a specification by checking whether the behaviors of a transition system that models the program's implementation correlate with the behaviors of a transition system that models its specification. In this paper, we investigate the effect of concurrency on the complexity of implementation verification. We consider trace-based and tree-based approaches to the verification of concurrent transition systems, with and without fairness. Our results show that in almost all cases the complexity of the problem is exponentially harder than that of the sequential case. Thus, as in the model-checking verification methodology, the state-explosion problem cannot be avoided.
AB - In implementation verification, we check that an implementation is correct with respect to a specification by checking whether the behaviors of a transition system that models the program's implementation correlate with the behaviors of a transition system that models its specification. In this paper, we investigate the effect of concurrency on the complexity of implementation verification. We consider trace-based and tree-based approaches to the verification of concurrent transition systems, with and without fairness. Our results show that in almost all cases the complexity of the problem is exponentially harder than that of the sequential case. Thus, as in the model-checking verification methodology, the state-explosion problem cannot be avoided.
UR - http://www.scopus.com/inward/record.url?scp=0037088945&partnerID=8YFLogxK
U2 - 10.1006/inco.2001.2920
DO - 10.1006/inco.2001.2920
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0037088945
SN - 0890-5401
VL - 173
SP - 143
EP - 161
JO - Information and Computation
JF - Information and Computation
IS - 2
ER -