An Algebra for the Analysis of Generalized Activity Networks

Abstract

This paper generalizes the approach of activity networks, exemplified by PERT and CPM, to networks in which activites and events occur probabilistically and contain logical relationships of a more complicated nature. For example, from a specific event some activities are undertaken with certainty while others probabilistically. It presents an algebra of analysis taking the decision rules or logical structure of the system as given. The approach is applicable to the analysis of practical situations such as contract bidding, flow in shops, etc.