The specification of DDM (Distributed Decision-Making) algorithms is addressed. The modeling technique presented is based on well-known extensions to Petri-Nets (PNs). Transition-enabling functions with a domain corresponding to the marking of a net are used to express the semantics of decision-making. Furthermore, the algorithm structural characteristics of global state representation and topology are incorporated. Finally, the dynamic nature of evolution of system state, interaction with processes external to the computation, and the interprocess communication aspects of the mechanism are also modeled. The elements of analysis associated with this model are described, but not detailed in the scope of this paper.
Date of this Version