A Petri Net Based Analysis of Deadlocks for Active Objects and Futures - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

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

(1) , (2, 3) , (1) , (4) , (5) , (2)
1
2
3
4
5

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.
Not file

Dates and versions

hal-00909292 , version 1 (26-11-2013)

Identifiers

  • HAL Id : hal-00909292 , version 1

Cite

Frank S. De Boer, Mario Bravetti, Immo Grabe, Matias David Lee, Martin Steffen, et al.. A Petri Net Based Analysis of Deadlocks for Active Objects and Futures. Formal Aspects of Component Software, 9th International Symposium, FACS 2012, 2012, Mountain View, United States. pp.110-127. ⟨hal-00909292⟩

Collections

INRIA INRIA2
83 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More