Decentralization of Process Nets with Centralized Control

The behavior of a net of interconnected, communicating processes is described in terms of the joint actions in which the processes can participate. A distinction is made between centralized and decentralized action systems. In the former, a central agent with complete information about the state of the system controls the execution of the actions; in the latter no such agent is needed. Properties of joint action systems are expressed in temporal logic. Centralized action systems allow for simple description of system behavior. Decentralized (two-process) action systems again can be mechanically compiled into a collection of CSP processes. A method for transforming centralized action systems into decentralized ones is described. The correctness of this method is proved, and its use is illustrated by deriving a process net that distributedly sorts successive lists of integers.

[1]  Giorgio De Michelis,et al.  Superposed Automata Nets , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[2]  Laura M. Haas,et al.  Distributed deadlock detection , 1983, TOCS.

[3]  Nissim Francez,et al.  Distributed Termination , 1980, TOPL.

[4]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[5]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[6]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

[7]  Nissim Francez,et al.  Fair termination of communicating processes , 1984, PODC '84.

[8]  Abraham Silberschatz,et al.  An Effective Implementation for the Generalized Input-Output Construct of CSP , 1983, TOPL.

[9]  K. Mani Chandy,et al.  A distributed algorithm for detecting resource deadlocks in distributed systems , 1982, PODC '82.