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 …
Spatial ordering of messages in a cyclic architecture
AK Bandyopadhyay - ACM SIGSOFT Software Engineering Notes, 2010 - dl.acm.org
Spatial ordering of messages can be used fruitfully for the design of distributed systems. For
modeling such systems we require a logical framework that includes both spatial …
modeling such systems we require a logical framework that includes both spatial …
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 …