Learn More
of n finite state machines, communicating with each other asynchronously using typed messages over unbounded FIFO channels, In this paper we present a data flow approach to analyzing these communicating machines for nonprogress properties (deadlock and unspecified reception). We set up flow equations to compute the set of pending messages in the queues at(More)
We present a new and practical spanning tree based routing algorithm for mobile ad hoc networks (MANET). The algorithm, named LCMRMGCS, extends and significantly enhances the LCMRMG MANET routing algorithm previously proposed in W. Peng et al., (2003). Hosts in a LCMRMGCS MANET form non-overlapping trees. Our simulation results show that LCMRMGCS(More)
Let P and Q be two finite state machines, communicating with each other asynchronously using typed messages over unbounded FIFO channels. We present in this paper, a dataflow approach to analyzing these communicating machines for non-progress properties (deadlock and unspecified reception). We set up flow equations to compute the set of pending messages in(More)