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 problem, 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.
Towards an ASM-based Characterization of the Deadlock-freedom Property
BIANCHI, Alessandro;PIZZUTILO, Sebastiano;VESSIO, GENNARO
2016-01-01
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 problem, 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
