The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1993 vol.19)
pp: 198-199
ABSTRACT
<p>The commenters discuss several flaws they found in the above-titled paper by G.M. Koran and R.J.A. Burh. The commenters argue that the characterization of operational and axiomatic proof method is modified and inaccurate; the classification of modeling techniques for concurrent systems confuses the distinction between state-based and event-based models with the essential distinction between explicit enumeration of behaviors and symbolic manipulation of properties; the statements about the limitations of linear-time temporal logic in relation to nondeterminism are inaccurate; and the characterization of the computational complexity of the analysis technique is overly optimistic.</p>
INDEX TERMS
temporal logic-based deadlock analysis; state-based models; Ada; axiomatic proof method; event-based models; symbolic manipulation; nondeterminism; computational complexity; Ada; computational complexity; concurrency control; symbol manipulation; temporal logic
CITATION
M. Agrawala, D.L. Jain, "Comments on 'Temporal Logic-Based Deadlock Analysis for Ada' by G.M. Karam and R.J.A. Burh", IEEE Transactions on Software Engineering, vol.19, no. 2, pp. 198-199, February 1993, doi:10.1109/32.214836
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool