Advertisement

A Petri Net Based Analysis of Deadlocks for Active Objects and Futures

  • Frank S. de Boer
  • Mario Bravetti
  • Immo Grabe
  • Matias Lee
  • Martin Steffen
  • Gianluigi Zavattaro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7684)

Abstract

We give two different notions of deadlock for systems based on active objects and futures. One is based on blocked objects and conforms with the classical definition of deadlock by Coffman, Jr. et al. The other one is an extended notion of deadlock based on blocked processes which is more general than the classical one. We introduce a technique to prove deadlock freedom of systems of active objects. To check deadlock freedom an abstract version of the program is translated into Petri nets. Extended deadlocks, and then also classical deadlock, can be detected via checking reachability of a distinct marking. Absence of deadlocks in the Petri net constitutes deadlock freedom of the concrete system.

Keywords

Operational Semantic Active Object Reachability Problem Abstract Semantic Deadlock Detection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abadi, M., Cardelli, L.: A Theory of Objects. Monographs in Computer Science. Springer (1996)Google Scholar
  2. 2.
    Ábrahám, E., Grabe, I., Grüner, A., Steffen, M.: Behavioral interface description of an object-oriented language with futures and promises. Journal of Logic and Algebraic Programming 78(7), 491–518 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Armstrong, J.: Erlang. Communications of ACM 53(9), 68–75 (2010)CrossRefGoogle Scholar
  4. 4.
    Busi, N., Zavattaro, G.: Deciding reachability problems in turing-complete fragments of mobile ambients. Mathematical Structures in Computer Science 19(6), 1223–1263 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Caromel, D., Henrio, L., Serpette, B.P.: Asynchronous and deterministic objects. SIGPLAN Not. 39(1), 123–134 (2004)CrossRefGoogle Scholar
  6. 6.
    de Boer, F.S., Bravetti, M., Grabe, I., Lee, M., Steffen, M., Zavattaro, G.: A petri net based analysis of deadlocks for active objects and futures, extended version (2012), http://cs.famaf.unc.edu.ar/~lee/publications/facs12_complete.pdf
  7. 7.
    Dijkstra, E.W.: Cooperating sequential processes. In: Genuys, F. (ed.) Programming Languages: NATO Advanced Study Institute, pp. 43–112. Academic Press (1968)Google Scholar
  8. 8.
    Edward, J., Coffman, G., Elphick, M.J., Shoshani, A.: System deadlocks. ACM Computing Surveys 3(2), 67–78 (1971)CrossRefGoogle Scholar
  9. 9.
    Giachino, E., Laneve, C.: Analysis of Deadlocks in Object Groups. In: Bruni, R., Dingel, J. (eds.) FMOODS/FORTE 2011. LNCS, vol. 6722, pp. 168–182. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  10. 10.
    Giachino, E., Laneve, C., Lascu, T.: Deadlock and livelock analysis in concurrent objects with futures. Technical report, University of Bologna (December 2011), http://www.cs.unibo.it/~laneve/publications.html
  11. 11.
    Gordon, A.D., Hankin, P.D.: A concurrent object calculus: Reduction and typing. In: Nestmann, U., Pierce, B.C. (eds.) Proceedings of HLCL 1998. Electronic Notes in Theoretical Computer Science, vol. 16.3, Elsevier Science Publishers (1998)Google Scholar
  12. 12.
    Smith, S.F., Agha, G.A., Mason, I.A., Talcott, C.L.: A foundation for actor computation. Journal of Functional Programming (1997)Google Scholar
  13. 13.
    Haller, P., Odersky, M.: Scala actors: Unifying thread-based and event-based programming. Theoretical Computer Science 410(2-3), 202–220 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Holt, R.C.: Some deadlock properties of computer systems. ACM Computing Surveys 4(3), 179–196 (1972)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Johnsen, E.B., Owe, O.: An Asynchronous Communication Model for Distributed Concurrent Objects. Software and Systems Modeling (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Frank S. de Boer
    • 1
  • Mario Bravetti
    • 2
  • Immo Grabe
    • 1
  • Matias Lee
    • 3
  • Martin Steffen
    • 4
  • Gianluigi Zavattaro
    • 3
  1. 1.CWIAmsterdamThe Netherlands
  2. 2.Focus Team INRIAUniversity of BolognaItaly
  3. 3.University of CórdobaArgentina
  4. 4.University of OsloNorway

Personalised recommendations