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.
2016
978-989-758-194-6
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11586/166568
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact