BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-75-97
       ENTRY:: December 01, 1994
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: DETERMINISTIC SEQUENTIAL NETWORKS UNDER RANDOM CONTROL
        TYPE:: Technical Report
      AUTHOR:: Varszegi, Sandor
        DATE:: September 1975
       PAGES:: 40
    ABSTRACT:: This paper presents a network-oriented approach for the
               treatment of deterministic sequential networks under random
               control. Considered are the cases of multinomial, stationary
               Markov and arbitrary input processes. Probabilities of the
               state and output processes are directly derived from the
               primary information of the network and the source. Coded
               networks are treated using the logic circuits or Boolean
               functions. The isomorphism between Boolean and event algebras
               is made use of, and the probabilities of the response
               processes are obtained in the form of algebraic probability
               expressions interpreted over the determining (i.e., input and
               initial state) minterm or signal joint probabilities.
       NOTES:: [Adminitrivia V1/Prg/19941201]
         END:: STAN//CSL-TR-75-97