On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification
AK Bandyopadhyay, J Bandyopadhyay - Journal of systems architecture, 2000 - Elsevier
On the derivation of a correct deadlock free communication kernel for loop connected message
passing architecture from its user's specification - ScienceDirect Skip to main contentSkip to …
passing architecture from its user's specification - ScienceDirect Skip to main contentSkip to …
Ordering of events in two-process concurrent system
J Banerjee, AK Bandyopadhyay… - ACM SIGSOFT Software …, 2007 - dl.acm.org
Dijkstra's weakest precondition calculus is extended to capture temporal ordering in
concurrent systems. This is done by defining temporal ordering predicates that is used to …
concurrent systems. This is done by defining temporal ordering predicates that is used to …
Avoidance of deadlock in loop structures—a two process solution
P Pramanik, PK Das, AK Bandyopadhyay… - Microprocessing and …, 1992 - Elsevier
FIG.I PMJCESS CONFIGURATION IN EACH NODE Page 1 Microprocessing and
Microprogramming 34 (1992) 103-106 103 North-Holland AVOIDANCE OF DEADLOCK IN LOOP …
Microprogramming 34 (1992) 103-106 103 North-Holland AVOIDANCE OF DEADLOCK IN LOOP …
On the correctness issues in two-process mutual exclusion algorithms
J Banerjee, AK Bandyopadhyay… - ACM SIGSOFT Software …, 2007 - dl.acm.org
Correctness issues in two process mutual exclusion algorithms are investigated. A new
theorem is proposed and proved that describes the key concept involved in such algorithms …
theorem is proposed and proved that describes the key concept involved in such algorithms …
Some investigations on deadlock freedom issues of a cyclically connected system using Dijkstra's weakest precondition calculus
J Banerjee, AK Bandyopadhyay, AK Mandal - ACM SIGPLAN Notices, 2007 - dl.acm.org
Weakest precondition calculus is used to specify a system implemented by a cyclic
interconnection of sequential processes. From this specification a predicate is derived that …
interconnection of sequential processes. From this specification a predicate is derived that …
[PDF][PDF] ON THE DERIVATION OF A CORRECT DEADLOCK FREE COMMUNICATION KERNEL FOR LOOP CONNECTED MESSAGE PASSING ARCHITECTURE
AK Bandyopadhyay, J Bandyopadhyay - researchgate.net
Method for the derivation of a correct deadlock free communication kernel for loop
connected message passing architecture from its user's specification is described. Dijkstra's …
connected message passing architecture from its user's specification is described. Dijkstra's …
[PDF][PDF] Temporal Modeling of Concurrent Processes
J Banerjee, AK Bandyopadhyay - researchgate.net
To model a concurrent system we sometimes need a calculus that can support temporal
ordering. In standard temporal logic [1] or in TLA [2, 3-5] we have the operators …
ordering. In standard temporal logic [1] or in TLA [2, 3-5] we have the operators …
[引用][C] A Deadlock-Free Communicating Kernel For Binary N-Cube Architectures
P Pramanik, PK Das… - Proceedings of the Fifth …, 1990 - ieeexplore.ieee.org
ABSTRACT A unidirectional loop of message passing computers may be made deadlock-
free by incorporating certain constraints. The present paper proposes a method for …
free by incorporating certain constraints. The present paper proposes a method for …