Towards an ASM-based Characterization of the Deadlock-freedom Property

Alessandro Bianchi, Sebastiano Pizzutilo, Gennaro Vessio

Abstract

The present paper investigates the effectiveness of the Abstract State Machine (ASM) formalism into studying the deadlock-freedom property in distributed systems. To this end, the well-known Dining Philosophers prob-lem, prone to deadlock, is here modeled through ASMs and deadlock is studied. The experience suggests a provisional reformulation of the classic necessary conditions for deadlock in terms of ASMs.

References

  1. Arcaini, P., Gargantini, A., Riccobene, E., 2010. AsmetaSMV: A Way to Link High-Level ASM Models to Low-Level NuSMV Specifications, Proc. of the 2nd International Conference on Abstract State Machines, Alloy, B and Z, pp. 61-74.
  2. Bianchi, A., Pizzutilo, S., Vessio, G., 2015. Applying Predicate Abstraction to Abstract State Machines, Enterprise, Business-Process and Information Systems Modeling, LNBIP 214, Springer, pp. 283-292.
  3. Bianchi, A., Pizzutilo, S., Vessio, G., 2016. Reasoning on Starvation in AODV using Abstract State Machines, Journal of Theoretical and Applied Information Technology, 84(1), pp. 140-149.
  4. Bingham, B., Bingham, J., Erickson, J., Greenstreet, M., 2013. Distributed Explicit State Model Checking of Deadlock Freedom, Proc. of the 25th International Conference on Computer Aided Verification, pp. 235- 241.
  5. Blass, A., Gurevich, Y., 2003. Abstract State Machines Capture Parallel Algorithms, ACM Transactions on Computational Logic, 4(4), pp. 578-651.
  6. Börger, E., Schewe, K.D., 2015. Concurrent abstract state machines, Acta Informatica, pp. 1-24.
  7. Börger, E., Stärk, R., 2003. Abstract State Machines: A Method for High-Level System Design and Analysis, Springer-Verlag.
  8. Brookes, S.D., Roscoe, A.W., 1991. Deadlock analysis in networks of communicating processes, Distributed Computing, 4(4), pp. 209-230.
  9. Coffman, E.G., Elphick, M.J., Shoshani, A., 1971. System Deadlocks, Computing Surveys, 3(2), pp. 67-78.
  10. Del Castillo, G., Winter, K., 2000. Model Checking Support for the ASM High-Level Language, Proc. of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 331- 346.
  11. Dershowitz, N., 2013. The Generic Model of Computation, Electronic Proceedings in Theoretical Computer Science.
  12. Dijkstra, E.W., 1968. Cooperating sequential processes, Genuys, F., ed., Programming Languages, Academic Press, pp. 43-112.
  13. Dijkstra, E.W., 1971. Hierarchical Ordering of Sequential Processes, Acta Informatica, 1(2), pp. 115-138.
  14. Farahbod, R., Gervasi, V., Glässer, U., 2007. CoreASM: An Extensible ASM Execution Engine, Fundamenta Informaticae, 77(1-2), pp. 71-103.
  15. Farahbod, R., Glässer, U., Ma, G., 2007. Model Checking CoreASM Specifications, Prinz, A., ed., 14th International ASM Workshop.
  16. Gabrisch, W., Zimmermann, W., 2012. A Hoare-Style Verification Calculus for Control State ASMs, Proc. of the 5th Balkan Conference on Informatics, pp. 205-210.
  17. Glausch, A., Reisig, W., 2009. An ASM-Characterization of a Class of Distributed Algorithms, Abrial, J.R., Glässer, U., eds., Rigorous Methods for Software Construction and Analysis, pp. 50-64.
  18. Gurevich, Y., 1995. Evolving Algebras 1993: Lipari Guide, Börger, E., ed., Specification and Validation Methods, Oxford University Press, pp. 9-36.
  19. Gurevich, Y., 2000. Sequential Abstract State Machines Capture Sequential Algorithms, ACM Transactions on Computational Logic, 1(1), pp. 77-111.
  20. Gurevich, Y., Rosenzweig, D., 2000. Partially ordered runs: A case study. In: Abstract State Machines - Theory and Applications, pp. 131-150.
  21. Holt, R.C., 1972. Some Deadlock Properties of Computer Systems, ACM Computing Surveys, 4(3), pp. 179-196.
  22. Kameda, T., 1980. Testing Deadlock-Freedom of Computer Systems, Journal of the ACM, 27(2), pp. 270-280.
  23. Knapp, E., 1987. Deadlock detection in distributed databases, ACM Computing Surveys, 19(4), pp. 303-328.
  24. Lamport, L., 1974. A New Solution of Dijkstra's Concurrent Programming Problem, Communications of the ACM, 17(8), pp. 453-455.
  25. Padovani, L., 2014. Deadlock and lock freedom in the linear p-calculus, Proc. of CSL-LICS 7814, article no. 72.
  26. Rafe, V., Doostali, S., 2012. ASM2Bogor: An approach for verification of models specified through Asmeta language, Journal of Visual Languages and Computing, 23(5), pp. 287-298.
  27. Reisig, W., 2003. The Expressive Power of Abstract State Machines, Computing and Informatics, 22, pp. 209- 219.
  28. Singhal, M., 1989. Deadlock Detection in Distributed Systems, Computer, 22(11), pp. 37-48.
  29. Spielmann, M., 1999. Automatic Verification of Abstract State Machines, Proc. of the 11th International Conference on Computer Aided Verification, pp. 431-442.
  30. Stärk, R.F., Nanchen, S., 2001. A Logic for Abstract State Machines, Journal of Universal Computer Science, 7(11), pp. 981-1006.
Download


Paper Citation


in Harvard Style

Bianchi A., Pizzutilo S. and Vessio G. (2016). Towards an ASM-based Characterization of the Deadlock-freedom Property . In Proceedings of the 11th International Joint Conference on Software Technologies - Volume 2: ICSOFT-PT, (ICSOFT 2016) ISBN 978-989-758-194-6, pages 123-130. DOI: 10.5220/0006002901230130


in Bibtex Style

@conference{icsoft-pt16,
author={Alessandro Bianchi and Sebastiano Pizzutilo and Gennaro Vessio},
title={Towards an ASM-based Characterization of the Deadlock-freedom Property},
booktitle={Proceedings of the 11th International Joint Conference on Software Technologies - Volume 2: ICSOFT-PT, (ICSOFT 2016)},
year={2016},
pages={123-130},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006002901230130},
isbn={978-989-758-194-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 11th International Joint Conference on Software Technologies - Volume 2: ICSOFT-PT, (ICSOFT 2016)
TI - Towards an ASM-based Characterization of the Deadlock-freedom Property
SN - 978-989-758-194-6
AU - Bianchi A.
AU - Pizzutilo S.
AU - Vessio G.
PY - 2016
SP - 123
EP - 130
DO - 10.5220/0006002901230130