Ordinary differential equation-based deadlock detection

IEEE Transactions on Systems, Man, and Cybernetics: Systems

Volumn 44, Issue 10, 2014, Pages 1435-1454

  Ding, Zuohua ^a   Zhou, Mengchu ^b,c   Wang, Shouguang ^d  

^a ZHEJIANG SCI TECH UNIVERSITY   (China)

^b Ministry of Education   (China)

^c NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^d ZHEJIANG GONGSHANG UNIVERSITY   (China)

Author keywords

Concurrent program; concurrent system; continuous Petri net; deadlock detection; ordinary differential equation; state space explosion

Indexed keywords

EQUATIONS OF STATE; MATLAB; PETRI NETS; STATIC ANALYSIS;

CONCURRENT PROGRAM; CONCURRENT SYSTEMS; CONTINUOUS PETRI NET; DEADLOCK DETECTION; STATE-SPACE EXPLOSION;

ORDINARY DIFFERENTIAL EQUATIONS;

EID: 84907203639     PISSN: 21682216     EISSN: 21682232     Source Type: Journal    
DOI: 10.1109/TSMC.2014.2311757     Document Type: Article

References (88)

1. U. M. Ascher and L. R. Petzold, Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations. Philadelphia, PA, USA: Soc. Ind. Appl. Math., 1998.
2. G. S. Avrunin, U. A. Buy, J. C. Corbett, L. K. Dillon, and J. C. Wileden, "Automated analysis of concurrent systems with the constrained expression toolset," IEEE Trans. Softw. Eng., vol. 17, no. 11, pp. 1204-1222, Nov. 1991.
3. D. Z. Badal, "The distributed deadlock detection algorithm," ACM Trans. Comput. Syst., vol. 4, no. 4, pp. 320-377, 1986.
4. K. Barkaoui and J. F. Pradat-Peyre, "Verification in concurrent programming with petri nets structural techniques," in Proc. 3rd IEEE Int. High-Assurance Syst. Eng. Symp., 1998, pp. 124-133.
5. C. Böhm and G. Jacopini, "Flow diagram, turing machines and languages with only two formation rules," Commun. ACM, vol. 9, no. 5, pp. 366-371, 1966.
6. A. Boukerche and C. Tropper, "A distributed graph algorithm for the detection of local cycles and knots," IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 8, pp. 748-757, Aug. 1998.
7. G. Bracha and S. Toueg, "A distributed algorithm for generalized deadlock detection," Distrib. Comput., vol. 2, no. 3, pp. 127-138, 1987.
8. J. Brzezinski, J. M. Helary, M. Raynal, and M. Singhal, "Deadlock models and a general algorithm for distributed deadlock detection," J. Parallel Distrib. Comput., vol. 31, no. 2, pp. 112-125, 1995.
9. J. R. Burch, E. M. Clarke, and D. E. Long, "Representing circuts more efficiently in symbolic model checking," in Proc. 28th Design Autom. Conf., 1991, pp. 403-407.
10. J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang, "Symbolic model checking: 1020 states and beyond, Inf. Comput., vol. 9, no. 2, pp. 142-170, 1992.
11. K. M. Chandy, J. Misra, and L. M. Haas, "Distributed deadlock detection," ACM Trans. Comput. Syst., vol. 1, no. 2, pp. 144-156, 1983.
12. I. Cidon, "An efficient distributed knot detection algorithm," IEEE Trans. Softw. Eng., vol. 15, no. 5, pp. 644-649, May 1989.
13. E. M. Clarke, O. Grumberg, and D. Peled, Model Checking. Cambridge, MA, USA: MIT Press, 1999.
14. E. Clarke, K. McMillan, S. Campos, and V. Hartonas-Garmhausen, "Symbolic model checking," in Proc. 8th Comput. Aided Verification Conf., 1996, pp. 419-427.
15. E. M. Clarke, O. Grumberg, and D. E. Long, "Model checking and abstraction," ACM Trans. Program. Language Syst., vol. 16, no. 5, pp. 1512-1542, 1994.
16. J. C. Corbett, "An empirical evaluation of three methods for deadlock analysis of Ada tasking programs," in Proc. ACM SIGSOFT Int. Symp. Softw. Test. Anal., 1994, pp. 204-215.
17. J. C. Corbett, "Evaluating deadlock detection methods for concurrent software," IEEE Trans. Softw. Eng., vol. 22, no. 3, pp. 161-180, Mar. 1996.
18. J. C. Corbett, "Using shape analysis to reduce finite state models of concurrent java programs," ACM Trans. Softw. Eng. Method., vol. 9, no. 1, pp. 51-93, 2000.
19. J. C. Corbett and G. S. Avrunin, "Using integer programming to verify general safety and liveness properties," Formal Meth. Syst. Design, vol. 6, no. 1, pp. 97-123, 1995.
20. R. David and H. Alla, Discrete, Continuous, and Hybrid Petri Nets. New York, NY, USA: Springer-Verlag, 2010.
21. I. Demongodin and N. T. Koussoulas, "Differential petri nets: Representing continuous systems in a discrete-event world," IEEE Trans. Autom. Control, vol. 43, no. 4, pp. 573-579, Apr. 1998.
22. E. W. Dijkstra, "Hierarchical ordering of sequential processes," Acta Inf., vol. 1, no. 2, pp. 115-138, 1971.
23. Z. Ding, "Static analysis of concurrent programs using ordinary differential equations," in Proc. ICTAC, LNCS 5684. pp. 1-35, Aug. 2009.
24. S. Duri, U. Buy, R. Devarapalli, and S. M. Shatz, "Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada," ACM Trans. Softw. Eng. Method., vol. 3, no. 4, pp. 340-380, 1994.
25. M. B. Dwyer and L. A. Clarke, "A compact petri net representation and its implications for analysis," IEEE Trans. Softw. Eng., vol. 22, no. 11, pp. 794-811, Nov. 1996.
26. M. B. Dwyer and L. A. Clarke, "Data flow analysis for verifying properties of concurrent programs," in Proc. 2nd Symp. Found. Softw. Eng., pp. 62-75, 1994.
27. D. Gilbert and M. Heiner, "From petri nets to differential equations: An integrative approach for biochemical network analysis," Lect. Notes Comput. Sci., vol. 4024, pp. 181-200, 2006.
28. P. Godefroid and D. Pirottin, "Refining dependendes improves partialorder verification methods," in Proc. 5th Int. Conf. Comput. Aided Verfication, 1993, pp. 438-449.
29. E. Hairer, S. P. Nørsett, and G. Wanner, Solving Ordinary Differential Equations (I), Nonstiff Problems, 2nd ed. New York, NY, USA: Springer-Verlag, 1993.
30. D. Helmbold and D. Luckham, "Debugging Ada tasking programs," IEEE Softw., vol. 2, no. 2, pp. 47-57, Mar. 1985.
31. R. C. Holt, "Some deadlock properties on computer systems," ACM Comput. Surveys, vol. 4, no. 3, pp. 179-196, 1972.
32. G. J. Holzmann. (1980). Basic Spin Manual [Online]. Available: http://cm.bell-labs.com/netlib/spin/whatispin.html
33. S. T. Huang, "A distributed deadlock detection algorithm for CSP-Like communication," ACM Trans. Program. Lang. Syst., vol. 12, no. 1, pp. 102-122, 1990.
34. G. M. Karam and R. J. Buhr, "Starvation and critical race analyzers for Ada," IEEE Trans. Softw. Eng., vol. 16, no. 8, pp. 829-843, Aug. 1990.
35. Y. M. Kim, T. H. Lai, and N. Soundarajan, "Efficient distributed deadlock detection and resolution using probes, tokens, and barriers," in Proc. Int. Conf. Parallel Distrib. Syst., 1997, pp. 584-591.
36. E. Knapp, "Deadlock detection in distributed syatems," ACM Comput. Surveys, vol. 19, no. 4, pp. 303-328, 1987.
37. A. D. Kshemkalyani and M. Singhal, "A one-phase algorithm to detect distributed deadlocks in replicated databases," IEEE Trans. Knowl. Data Eng., vol. 11, no. 6, pp. 880-895, Nov.-Dec. 1999.
38. S. Lee, "Fast, centralized detection and resolution of distributed deadlocks in the generalized model," IEEE Trans. Softw. Eng., vol. 30, no. 9, pp. 561-573, Sep. 2004.
39. W. J. Lee and H. N. Kim, "A Slicing-based approach to enhance Petri net reachability analysis," J. Res. Prac. Inf. Technol., vol. 32, no. 2, pp. 131-143, 2000.
40. J. Li, M. C. Zhou, and X. Dai, "Algebraic reduction and refinement of Petri nets," IEEE Trans. Syst., Man, Cybern. A, Syst. Humans, vol. 42, no. 5, pp. 1244-1255, Sep. 2012.
41. B. Lin, "Efficient compilation of process-based concurrent programs without run-time scheduling," in Proc. DATE, 1998, pp. 211-217.
42. D. L. Long and L. A. Clarke, "Task interaction graphs for concurrency analysis," in Proc. 11th ICSE, 1989, pp. 44-52.
43. J. P. Lopez-Grao and J. M. Colom, "On the deadlock analysis of multithreaded control software," in Proc. 16th IEEE Int. Conf. Emerg. Technol. Factory Autom., Sep. 2011, pp. 1-8.
44. J. Lunze, B. Nixdorf, and H. Richter, "Hybrid modelling of continuousvariable systems with application to supervisory control," in Proc. Eur. Control Conf., 1997, pp. 1-6.
45. D. Manivannan and M. Singhal, "An efficient distributed algorithm for detection of knots and cycles in a distributed graph," IEEE Trans. Parallel Distrib. Syst., vol. 14, no. 10, pp. 961-972, Oct. 2003.
46. D. Mandrioli, R. Zicari, C. Ghezzi, and F. Tisato, "Modeling the Ada task system by petri nets," Comput. Lang., vol. 10, no. 1, pp. 43-61, 1985.
47. S. P. Masticola and E.G. Ryder, "Static infinite wait anomaly detection in polynomial time," in Proc. Int. Conf. Parallel Process., vol. 2. 1990, pp. 78-87.
48. D. McAllester, "On the complexity analysis of static analyses," in Proc. SAS, LNCS 1694. 1999, pp. 312-329.
49. K. L. McMillan, Symbolic Model Checking. Boston, MA, USA: Kluwer, 1993.
50. J. Misra and K. M. Chandy, "A distributed graph algorithm: Knot detection," ACM Trans. Program. Lang. Syst., vol. 4, no. 4, pp. 678-686, 1982.
51. M. K. Molloy, "Fast bounds for stochastic petri nets," Int. Workshop Timed Petri Nets, Jul. 1985, pp. 244-249.
52. E. T. Morgan and R. R. Razouk, "Interactive state space analysis of concurrent systems," IEEE Trans. Softw. Eng., vol. SE-12, no. 10, pp. 1080-1091, Oct. 1987.
53. T. Murata, "Modeling and analysis of concurrent systems," Handbook of Software Engineering, C. R. Vick and C. V. Ramamoorthy Eds. New York, NY, USA: Van Nostrand Reinhold, 1983.
54. T. Murata, E, Shenker, and S. M. Shatz, "Detection of Ada static deadlocks using Petri net invariants," IEEE Trans. Softw. Eng., vol. 15, no. 3, pp. 314-326, Mar. 1989.
55. N. Natarajan, "A distributed scheme for detecting communication deadlocks," IEEE Trans. Softw. Eng., vol. SE-12, no. 4, pp. 531-537, Apr. 1986.
56. G. Naumovich, G. Avrunin, and L. Clarke, "Applying static analysis to software architectures," ACM SIGSOFT Notes, vol. 22, no. 6, pp. 77-93, 1997.
57. W. K. Ng and C. V. Ravishankar, "On-Line detection and resolution of communication deadlocks," in Proc. 27th Annu. Hawaii Int. Conf. Syst. Sci., 1994, pp. 524-533.
58. M. Notomi and T. Murata, "Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis," IEEE Trans. Softw. Eng., vol. 20, no. 5, pp. 325-336, May 1994.
59. R. Obermarck, "Distributed deadlock detection algorithm," ACM Trans. Database Syst., vol. 7, no. 2, pp. 187-208, 1982.
60. P. Peleties and R. DeCarlo, "Analysis of hybrid systems using symbolic dynamics and Petri nets," Automatica, vol. 30, no. 9, pp. 1421-1442, 1994.
61. M. Pezze, R. N. Taylor, and M. Young, "Graph models for reachability analysis," ACM Trans. Softw. Eng. Method., vol. 4, no. 2, pp. 171-213, 1995.
62. L. Priese and H. Wimmel, Theoretische Informatik: Petri-Netze. Berlin, Germany: Springer, 2003
63. L. Recalde, S. Haddad, and M. Silva, "Continuous Petri nets: Expressive power and decidability issues," Lect. Notes Comput. Sci., vol. 4762, pp. 362-377, Oct. 2007.
64. J. H. Reif and S. A. Smolka, "Data flow analysis of distributed communicating processes," J. Parallel Program., vol. 19, no. 1, pp. 1-30, 1990.
65. W. Reisig, Petri Nets: An Introduction (EATCS Monographs on Theorical Computer Science). Heidelberg, Germany: Springer-Verlag, 1985.
66. P. Rontogiannis, G. Pavlides, and A. Levy, "Distributed algorithm for communication deadlock detection, Inf. Softw. Technol., vol. 33, no. 7, pp. 483-488, 1991.
67. P. Rondogiannis and M. H. M. Cheng, "Petri-net-based deadlock analysis of process Algebra programs," Sci. Comput. Program., vol. 23, no. 1, pp. 55-89, 1994.
68. S. M. Shatz, K. Mai, C. Black, and S. Tu, "Design and implementation of a Petri net-based toolkit for Ada tasking analysis," IEEE Trans. Parallel Distrib. Syst., vol. 1, no. 4, pp. 424-441, Oct. 1990.
69. C. S. Shih and J. A. Stankovic, "Distributed deadlock detection in Ada runtime environments," in Proc. TRI-Ada, Dec. 1990, pp. 362-375.
70. M. Silva and L. Recalde, "On fluidification of Petri net models: From discrete to hybrid and continuous models," Annu. Rev. Contr., vol. 28, pp. 253-266, 2004.
71. M. Silva and L. Recalde, "Petri nets and integrality relaxations: A view of continuous Petri net models," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 32, no. 4, pp. 314-327, Nov. 2002.
72. M. Singhal, "Deadlock detection in distributed systems," IEEE Comput., vol. 22, no. 11, pp. 37-48, Nov. 1989.
73. A. P. Sistla, L. Miliades, and V. Gyuris, "SMC: A symmetry based model checker for verification of liveness properties," in Proc. 9th Comput. Aided Verification Conf., 1997, pp. 464-467.
74. R. N. Taylor, "A general purpose algorithm for analyzing concurrent programs," Commun. ACM, vol. 26, no. 5, pp. 362-376, 1983.
75. R. N. Taylor, "Complexity of analyzing the synchronization structure of concurrent programs," Acta Informatica, vol. 19, no. 1, pp. 57-84, 1983.
76. S. A. Teukolsky, W. H. Press, and W. T. Vetterling, Numerical Recipes in C++, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1993.
77. J. J. P. Tsai and K. Xu, "An empirical evaluation of deadlock detection in software architecture specifications," Ann. Softw. Eng., vol. 7, nos. 1-4, pp. 95-126, 1999.
78. S. Tu, S. M. Shatz, and T. Murata, "Theory and application of Petri net reduction for Ada-tasking deadlock analysls," Tech. Rep. 91-15, EECS Dept., Univ. Illinois, Chicago, IL, USA, 1991.
79. S. Tu, S. M. Shatz, and T. Murata, "Applying Petri net reduction to support Ada tasking deadlock analysis," in Proc. 11th Int. Conf. Distrib. Comput. Syst., 1990, pp. 96-103.
80. A. Valmari, "A stubborn attack on state explosion," in Proc. 2nd Int. Workshop Comput. Aided Verification, 1991, pp. 156-165.
81. A. von Mayrhauser, S. M. Hsueh, and P. K. Srimani, "Automated partial communication deadlock analysis after changes to Ada code," in Proc. 7th Int. Workshop Comput. Aided Softw. Eng., 1995, pp. 215-224.
82. B. E. Wojcik and Z. M. Wojcik, "Sufficient condition for a communication deadlock and distributed deadlock detection," IEEE Trans. Softw. Eng., vol. l5, no. 12, pp. 1587-1595, Dec. 1989.
83. W. J. Yeh and M. Young, "Compositional reachabhty analysls uslng process algebra," in Proc. TAV4, 1991, pp. 178-187.
84. M. Yoeli, "Specification and verification of asynchronous circuits using marked graphs," Concurrency and Nets, K. Voss, H. J. Genrich, and G. Rozenberg, Eds. Berlin, Germany: Springer-Verlag, 1987, pp. 605-622.
85. J. Zhou and K. C. Tai, "Deadlock analysis of synchronous messagepassing programs," in Proc. Int. Symp. Softw. Eng. Parallel Distrib. Syst., 1999, pp. 62-69.
86. M. C. Zhou and F. DiCesare, Petri Net Synthesis for Discrete Event Control of Manufact. Syst., London, U.K.: Kluwer, 1993.
87. M. C. Zhou and M. P. Fanti (Ed.), Deadlock Resolution in Computer-Integrated Syst., New York, NY, USA: Marcel Dekker, Jan. 2005.
88. M. C. Zhou and M. D. Jeng, "Modeling, analysis, simulation, scheduling, and control of semiconductor manufacturing systems: A petri net approach," IEEE Trans. Semiconduct. Manufact., vol. 11, no. 3, pp. 333-357, Aug. 1998.