Ordering of events in two-process concurrent system

Authors:
Jayasri Banerjee;Anup Kumar Bandyopadhyay;Ajit Kumar Mandal
Affiliations:
Jadavpur University, Kolkata, India;Jadavpur University, Kolkata, India;Jadavpur University, Kolkata, India
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
2007

Citing 7
Cited 6

Mathematical logic for computer science

Mathematical logic for computer science
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicate transformers for reasoning about concurrent computation

Science of Computer Programming
Maintaining knowledge about temporal intervals

Communications of the ACM
On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification

Journal of Systems Architecture: the EUROMICRO Journal
A Discipline of Programming

A Discipline of Programming
Verifying mutual exclusion and liveness properties with split preconditions

Journal of Computer Science and Technology

Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem

ACM SIGSOFT Software Engineering Notes
On the correctness issues in two-process mutual exclusion algorithms

ACM SIGSOFT Software Engineering Notes
Weakest precondition based verification tool that models spatial ordering

ACM SIGSOFT Software Engineering Notes
Weakest precondition based modelling and verification of a class of concurrent systems

International Journal of Artificial Intelligence and Soft Computing
Spatial ordering of messages in a cyclic architecture

ACM SIGSOFT Software Engineering Notes
Specifying fault-tolerance using split precondition logic

ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 describe necessary conditions. A new logical connective, viz., "implies in the past" is also defined to describe the cause and effect relationships. Ordering mechanism used in Peterson's two process mutual exclusion algorithm is explained by proving a theorem.