Ordering of events in two-process concurrent system
J Banerjee, AK Bandyopadhyay… - ACM SIGSOFT Software …, 2007 - dl.acm.org
J Banerjee, AK Bandyopadhyay, AK Mandal
ACM SIGSOFT Software Engineering Notes, 2007•dl.acm.orgDijkstra'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.
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.
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.
ACM Digital Library以上显示的是最相近的搜索结果。 查看全部搜索结果