Filters








78,149 Hits in 9.4 sec

On the progress of communication between two finite state machines

M.G. Gouda, E.G. Manning, Y.T. Yu
1984 Information and Control  
We consider the following problem concerning any two finite state machines M and N that exchange messages via two 1-directional channels.  ...  For a practical class of communicating machines, the problem is shown to be decidable, and the decidability algorithm is polynomial.  ...  ACKNOWLEDGMENTS The authors are thankful to Professor A. Meyer for his encouragement and to the referees whose suggestions have greatly improved the presentation.  ... 
doi:10.1016/s0019-9958(84)80014-5 fatcat:pec52koirrelnc5xsmu3f6uz4a

Synthesis of Communicating Finite-State Machines with Guaranteed Progress

M. Gouda, Yao-Tin Yu
1984 IEEE Transactions on Communications  
We present a methodology to synthesize two communicating finite-state machines which exchange messages over two one-directional, FIFO channels. The methodology consists of two algorithms.  ...  The first algorithm takes one machine M, and constructs two communicating machines M' and N' such that 1) M' is constructed from M by adding some receiving transitions to it, and 2) the communication between  ...  There are two basic approaches to ensure that the communication between two finite-state machines satisfies such progress properties.  ... 
doi:10.1109/tcom.1984.1096134 fatcat:k2vummpn6nfqzmes7gbvjgcsgu

Modeling physical layer protocols using communicating finite state machines

Mohamed G. Gouda, Khe-Sing The
1985 Proceedings of the ninth symposium on Data communications - SIGCOMM '85  
The methodology is based on three techniques that were proposed earlier to verify networks of communicating finite state machines; they are network decomposition, machine equivalence, and closed covers  ...  We illustrate the usefulness of communicating finite state machines in modeling a number of physical layer protocols that include (i) an asynchronous startstop protocol and (ii) a protocol for synchronous  ...  Networks of Communicating Finite State Machines Mi is a finite state machine that communicates with other finite state machines in W by exchanging messages via one-directional, unbounded,  ... 
doi:10.1145/319056.319005 dblp:conf/sigcomm/GoudaT85 fatcat:pepnoijc7bbspotsrikae5du3m

Performance evaluation of communicating processes

Ilya Gertner
1979 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems - SIGMETRICS '79  
describes the composite finite state machine, modeling two activities :n progress.  ...  The composite model then described system states as a vector of states of finite state machines each modeling one message in progress.  ...  Clearly, progress in this area depends on the extent to which finite state machines can describe existing oneratina systems or can be applied to describe future systems. vany future systems will be designed  ... 
doi:10.1145/800188.805461 fatcat:4ozborbc6zht3lfj43wja3oq3a

Performance evaluation of communicating processes

Ilya Gertner
1979 ACM SIGSIM Simulation Digest  
describes the composite finite state machine, modeling two activities :n progress.  ...  The composite model then described system states as a vector of states of finite state machines each modeling one message in progress.  ...  Clearly, progress in this area depends on the extent to which finite state machines can describe existing oneratina systems or can be applied to describe future systems. vany future systems will be designed  ... 
doi:10.1145/1013608.805461 fatcat:k7phqhddfbh7vnuupwjdukqg4q

Performance evaluation of communicating processes

Ilya Gertner
1979 Performance Evaluation Review  
describes the composite finite state machine, modeling two activities :n progress.  ...  The composite model then described system states as a vector of states of finite state machines each modeling one message in progress.  ...  Clearly, progress in this area depends on the extent to which finite state machines can describe existing oneratina systems or can be applied to describe future systems. vany future systems will be designed  ... 
doi:10.1145/1009373.805461 fatcat:tulyvj5exbgini2wguvnu3qslu

Generalized Fair Reachability Analysis for Cyclic Protocols: Part 1 [chapter]

Hong Liu, Raymond E. Miller
1995 IFIP Advances in Information and Communication Technology  
In this paper, the notion of fair reachability is generalized to cyclic protocols with n > 2 communicating finite state machines.  ...  An equivalence is established between the set of fair reachable states and the set of reachable states with equal channel length.  ...  Communicating Finite State Machines In this section, we brie:Hy introduce the communicating finite state machine model.  ... 
doi:10.1007/978-0-387-34867-4_18 fatcat:jsbnoyxya5g3pjqbnnqw4q2xpq

A technique for proving liveness of communicating finite state machines with examples

M. G. Gouda, C. K. Chang
1984 Proceedings of the third annual ACM symposium on Principles of distributed computing - PODC '84  
Consider a network of communicating finite state machines that exchange messages over unbounded, FIFO channels.  ...  A node in one of the machines is said to be "live" iff it is reached by its machine infinitely often during the course of communication, provided that the machines behave in some "fair" fashion.  ...  There are two one-directional, unbounded, FIFO channels between any two machines in the network.  ... 
doi:10.1145/800222.806734 dblp:conf/podc/GoudaC84 fatcat:lhgdisyo4jfz3dksryjc3frx4y

Recent Advances in the Theory of Checking Experiments with State-oriented Models

Alexandre PETRENKO
2016 DEStech Transactions on Environment Energy and Earth Science  
This problem has its roots in the theory of checking experiments for finite state machines. It continues to attract a lot of attention of research community.  ...  We consider the problem of model-based testing of reactive systems with state-oriented models, such as finite state machines and transition systems, both distinguishing inputs and outputs.  ...  Acknowledgement This research is supported in part by the NSERC of Canada and by the MEIE of Gouvernement du Québec.  ... 
doi:10.12783/dteees/seeie2016/4551 fatcat:lfwo5rrrtzeypheatqtfg4oqke

Finite State Testing and Syntax Testing

Amandeep Singh, Harmanjit Singh
2004 INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY  
This paper reviews the fundamental problems in testing finite state machines and techniques for solving these problems, tracing progress in the area from its inception to the present and the state of the  ...  This motivates the study of testing finite state machines to ensure the correct functioning of systems and to discover aspects of their behavior.  ...  There are two types of finite state machines: Mealy machines and Moore machines. The theory is very similar for the two types.  ... 
doi:10.24297/ijct.v3i1a.2725 fatcat:zifyyabqrngernasizirzlz2z4

Page 3748 of Mathematical Reviews Vol. , Issue 86h [page]

1986 Mathematical Reviews  
We discuss a technique to verify that the communication between a given pair of such machines will progress indefinitely; this implies that the communication is free from deadlocks and unspecified receptions  ...  Gouda, Mohamed G. (1-TX-C) 86h:68010 Closed covers: to verify progress for communicating finite state machines. IEEE Trans. Software Engrg. 10 (1984), no. 6, 846-855.  ... 

Innovation and creativity in process control and manufacturing

Adalberto Gabriel Diaz Torres, Isabel Cristina Gomez Galvis
2014 International Journal on Interactive Design and Manufacturing  
of Automatic Control of Processes for innovation projects, construct a profile from the student based on validated evidence of the professional comprehensive training solution, defined in learning skills  ...  [Tobon, 2005] for the structured approach to the problem of controlling processes and workable solution, aimed applies to integration of management actions functional process controls, integrating threads  ...  called Finite State Machines (FSM) known as Finite State Automata (FSA), based on the theory of networks Petri [Murata, 1989] , or their derivatives such as Grafcet methodologies that have proven effective  ... 
doi:10.1007/s12008-014-0258-8 fatcat:dliw5hgjwbffvf6leygap2vu6y

Specification and analysis of the FDDI MAC protocol using systems of communicating machines

GM Lundy, IF Akyildiz
1992 Computer Communications  
This model specifies each node as a finite state machine which has a set of local variables. With each transition is an enabling predicate and action.  ...  A model designed for the specification of communication protocols called systems of communicating machines is used to specify the FDDI token ring protocol, and to analyse its safety and "liveness' properties  ...  Each machine in the network is specified as a finite state machine augmented with local variables. Communication between machines is accomplished through shared variables.  ... 
doi:10.1016/0140-3664(92)90089-w fatcat:ivlktuxmsnhanj3rv4phwq4dvq

Abstractions, composition and reasoning

Ella E. Roubtsova, Ashley T. McNeile
2009 Proceedings of the 13th workshop on Aspect-oriented modeling - AOM '09  
We propose that different process algebraic composition techniques, combined with consideration of the restrictions on the ability of different parts of a system to share data and state, can provide a  ...  The paper presents our ideas and is aimed to initiate a discussion about the basis for identification of abstractions and the related areas of composition, reasoning and interface specifications, at the  ...  A stored state has a corresponding set of attribute values, including the state name. • D = {d1, d2, ..., d k }, k ∈ N, is a finite set of derived states calculated using the states of the machine itself  ... 
doi:10.1145/1509297.1509303 fatcat:4vudlss7srevdbia7isquet4na

Synthesizing operating system based device drivers in embedded systems

Shaojie Wang, Sharad Malik
2003 Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign & system synthesis - CODES+ISSS '03  
Our solution to this problem starts by accurately specifying device access behavior with a formal model, viz. extended event driven finite state machines.  ...  We state easy to check soundness conditions on the model that subsequently guarantee properties such as bounded execution time and deadlock-free behavior.  ...  We say a request f is nested in a request r if an event handler of r calls f. The communication between eventdriven finite state machines may enforce an execution order between them.  ... 
doi:10.1145/944654.944655 fatcat:eu3nzsbekbbatky77tisocg2h4
« Previous Showing results 1 — 15 out of 78,149 results