Advertisement

Behavior Analysis of Software Systems Based on Petri Net Slicing

  • Jiaying Ma
  • Wei Han
  • Zuohua Ding
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7389)

Abstract

This paper presents a new method to analyze system behavior. A software system is modeled by a Petri net, and then the Petri net is sliced into several parts based on T-invariant. It has been shown that the behavior of the slices is equivalent to the behavior of the original Petri net. Thus we can analyze the system behaviors by checking each slice. With this method, state space explosion problem in the static analysis can be solved to some extent. The Dining Philosophy problem has been used to demonstrate the benefit of our method.

Keywords

behavior analysis petri net model slicing t-invariant 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ascher, U.M., Petzold, L.R.: Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations. Society for Industrial & Applied Mathematis, Philadelphia (1998)zbMATHCrossRefGoogle Scholar
  2. 2.
    Avrunin, G.S., Buy, U.A., Corbett, J.C., Dillon, L.K., Wileden, J.C.: Automated Analysis of Concurrent Systems With The Constrained Expression Toolset. IEEE Transactions on Software Engineering 17(11), 1204–1222 (1991)CrossRefGoogle Scholar
  3. 3.
    Brückner, I.: Slicing CSP-OZ Specifications. In: Proc. of the 16th Nordic Workshop on Programming Theory, pp. 71–73. Uppsala University, Sweden (2004)Google Scholar
  4. 4.
    Brückner, I., Wehrheim, H.: Slicing Object-Z Specifications for Verification. In: Treharne, H., King, S., C. Henson, M., Schneider, S. (eds.) ZB 2005. LNCS, vol. 3455, pp. 414–433. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Chang, C.K., Wang, H.: A Slicing Algorithm of Concurrency Modeling Based on Petri Nets. In: Proc. of the Intermational Conf. on Parallel Processing 1986, pp. 789–792. IEEE Computer Society Press (1986)Google Scholar
  6. 6.
    Clarke, E.M., Grumberg, O., Long, D.E.: Model Checking and Abstraction. ACM Transactions on Programming Language Systems 16(5), 1512–1542 (1994)CrossRefGoogle Scholar
  7. 7.
    Dijkstra, E.W.: Hierarchical Ordering of Sequential Processes. Acta Informat. 2, 115–138 (1971)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Heimdahl, M.P.E., Whalen, M.W.: Reduction and Slicing of Hierarchical State Machines. In: Jazayeri, M. (ed.) ESEC/FSE 1997. LNCS, vol. 1301, pp. 450–467. Springer, Heidelberg (1997)Google Scholar
  9. 9.
    Lee, J.: Scheduling Analysis with Resources Share Using The Transitive Matrix Based on P-invariant. In: Proceedings of the 41st SICE Annual Conference 2002, pp. 5–7 (2002)Google Scholar
  10. 10.
    Lee, W.J., Kim, H.N.: A Slicing-Based Approach to Enhance Petri Net Reachability Analysis. Journal of Research and Practice in Information Technology 32, 131–143 (2000)Google Scholar
  11. 11.
    Llorens, M., Oliver, J., et al.: Dynamic Slicing Techniques for Petri Nets. Electronic Notes in the Theoretical Computer Science 223, 1–12 (2008)CrossRefGoogle Scholar
  12. 12.
    Long, D.L., Clarke, L.A.: Task Interaction Graphs for Concurrency Analysis. In: Proceedings of 11th ICSE, Pittsburgh, Penn., USA, pp. 44–52 (1989)Google Scholar
  13. 13.
    Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE 77, 541–580 (1989)CrossRefGoogle Scholar
  14. 14.
    Rakow, A.: Slicing Petri Nets with an Application to Workflow Verification. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 436–447. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  15. 15.
    Rakow, A.: Slicing Petri Nets. In: Proceeding of the Workshop on FABPWS 2007, Satellite Event, Siedlce, pp. 55–76 (2007)Google Scholar
  16. 16.
    Sloane, A.M., Holdsworth, J.: Beyond Traditional Program Slicing. In: Proc. of the International Symp. on Software Testing and Analysis, San Diego, CA, pp. 180–186 (1996)Google Scholar
  17. 17.
    Weiser, M.: Program Slicing. IEEE Transactions on Software Engineering 10, 352–357 (1984)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jiaying Ma
    • 1
  • Wei Han
    • 1
  • Zuohua Ding
    • 1
    • 2
  1. 1.Lab of Intelligent Computing and Software EngineeringZhejiang Sci-Tech UniversityHangzhouP.R. China
  2. 2.Institute of Logic and CognitionSun Yat-sen UniversityGuangzhouP.R. China

Personalised recommendations