Mealy, G. (1955), `A Method for Synthesizing Sequential Circuits', Bell System Technology J. 34, 1045--1079.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....n = 4, and the length of the string d ( is 3. So, each state is labeled by a string from the language 0, 1 4 0, 1 . The output of the machine is a string s # P, where which contains the placement information. Since the P FSA produces output on transitions, we have a Mealy machine [7]. We define a P FSA, M, as a six tuple M = Q, #,# , #, #, q 0 ) where: Q is the set of states with labels representing the allocation state of machine resources, the input alphabet #=C, is the set of selection criteria, the output alphabet # P, is the set of memory location strings, ....

.... test function callee( void test function caller( dblcvt cvt; static struct 2 struct 2 arg 3 = 0x34,0x8f, double double arg 2; cvt.bytes[0] 0xe2; cvt.bytes[1] 0xed; cvt.bytes[2] 0xab; cvt.bytes[3] 0xad; cvt.bytes[4] 0x67; cvt.bytes[5] 0x31; cvt.bytes[6] 0xee; cvt.bytes[7] = 0x7; double arg 2 = cvt.dbl; test function callee(0x44026097l, double arg 2, struct 2 arg 3) typedef union unsigned char bytes[8] double dbl; dblcvt; typedef struct struct 2 unsigned char field[2] struct 2; void test function callee(long arg 1, double arg 2, struct 2 arg 3) long ....

[Article contains additional citation context not shown here]

G. H. Mealy, "A method for synthesizing sequential circuits," Bell System Technical Journal, vol. 35, no. 5, pp. 1045--1079, 1955.

....assumption: Input events are atomic, so they occur instantaneously, one at a time. An input event causes a state transition, which also takes place instantaneously. A state transition may trigger (cause) output events. Similar assumptions are made in Mealy s finite state machines, introduced in [Mea55] As a starting point, we introduce these Mealy machines, and then we present our machine model as a modification. Recall (cf. HU80, p. 43] that a Mealy FSM is a six tuple (I ; O; S; ffi; s 0 ) where ffl I is a finite set of input symbols; ffl O is a finite set of output symbols; ffl S is ....

G.H. Mealy. A method for synthesizing sequential circuits. Bell System Technical Journal, 34(5):1045--1079, 1955. 75

....Using Specifications . 13 January 3 (10:22am) ACM Transactions on Programming Languages and Systems the language 0, 1 4 0, 1 3 . The output of M is a string s P, where , which contains the placement information. Since the P FSA produces output on transitions, we have a Mealy machine [Mealy 1955]. We define a P FSA, M, as a six tuple 1 M = Q, S, D, d, l, q 0 ) where: Q is the set of states with labels representing the allocation state of machine resources, the input alphabet S = C, is the set of selection criteria, the output alphabet D = P, is the set of placement ....

Mealy, G. H. (1955). A method for synthesizing sequential circuits. Bell System Technical Journal, 35(5):1045--1079.

....of the system. As an aid to understanding TLA formulas, we introduce here a type of picture called a predicate action diagram. These diagrams are similar to the various kinds of state transition diagrams that have been used for years to describe systems, starting with Mealy and Moore machines [1], 2] We relate these pictures to TLA specifications by interpreting a predicate action diagram as a TLA formula. A diagram denoting formula D is a correct description of a system with specification S i# (if and only if) S implies D. We therefore provide a precise statement of what it means for a ....

....a natural number, #M 1 # #x,y# is always enabled. Hence, WF #x, y# (M 1 ) implies that there are infinitely many #M 1 # #x,y# steps, so x is incremented infinitely often. Similarly, WF #x, y# (M 2 ) implies that y is incremented infinitely E n v i r o n m e n t C E l e m e n t in[1] in [n] out # # . # # # # # Fig. 2. A Muller C element. often. Putting this all together, we see that # is true of a behavior i# (i) x and y are initially zero, ii) every step increments either x or y by one and leaves the other unchanged or else leaves both x and y unchanged, and (iii) ....

[Article contains additional citation context not shown here]

G. H. Mealy, "A method for synthesizing sequential circuits," Bell System Technical Journal, vol. 34, pp. 1045--1079, Sept. 1955.

....allocation state. In our example convention, n = 4, and = 3. So, each state is labeled by a string from the language 0, 1 4 0, 1 3 . The output of M is a string s P, where , which contains the placement information. Since the P FSA produces output on transitions, we have a Mealy machine [Mea55]. We define a P FSA, M, as a six tuple M = Q, S, D, d, l, q 0 ) where: Q is the set of states with labels representing the allocation state of machine resources, the input alphabet S = C, is the set of selection criteria, the output alphabet D = P, is the set of placement strings, the ....

G. H. Mealy. A method for synthesizing sequential circuits. Bell System Technical Journal, 35(5):1045---1079, 1955.

....1 by a dynamical recognizer is the set of strings in S whose final states pass the decision test. ############### 1 To turn a recognizer into a generator, simply enumerate the strings in S and filter out those the recognizer rejects. 6 J. B. Pollack In the Mealy Machine formulation (Mealy, 1955), which I use in the model below, the decision function applies to the penultimate state and the final token: G (z k (n 1) s n ) 0,1 . Just as in the case for finite automata, labeling the arcs rather than the nodes can often result in smaller machines. There are many variants possible, but both ....

Mealy, G. H. (1955). A method for synthesizing sequential circuits. Bell System Technical Journal, 43, 1045-1079.

....Petri nets are used as the main behavioral model for specification. Techniques for synthesis, analysis and formal verification of asynchronous circuits are reviewed and discussed. 1 Introduction Finite State Machines has been the most traditional model of computation for sequential circuits [25, 26]. It is a state based model in which the system, being in a state, reads some inputs, writes some outputs and moves to another state. Time is discretized by the notion of cycle, which is the time that takes the system to move from one state to another. This model is appropriate to derive circuit ....

G.H. Mealy. A method for synthesizing sequential circuits. Bell System Technical J., 34(5):1045--1079, 1955.

....error performance estimation should be beneficial. 1. 4 Overview of the Thesis In this thesis, the distance spectrum calculation for a general trellis code is tackled using finite state machine theory, especially the state minimisation algorithm first proposed by Huffman (1954) 49] Mealy (1955) [50] and Moore (1956) 51] Firstly the method of construction of a single finite state machine from multiple several FSM s is proposed. Then the state space partitioning method is illustrated. As an extension to the classical FSM theory, a time inverse state space partitioning process is described, ....

....FSM s was mainly developed in the 1950 s. General finite state machine theory and applications can be found in text books on discrete mathematics [75, 76, 77] and digital switching theory [78, 79] Central to the theory is the state minimisation process credited to Huffman (1954) 49] Mealy (1955) [50] and Moore (1956) 51] Various aspects of the theory were refined through the early 1960 s [80] Some improved algorithms were developed as late as 1970. One such is the Hopcroft state minimisation algorithm [81] although it should be noted that this is still not optimal [82] FSM minimisation ....

[Article contains additional citation context not shown here]

G. H. Mealy, "Methods for synthesizing sequential circuits," Bell System Tech. J., vol. 34, pp. 1045--1079, 1955.

....the variable p to represent the input and the variable q to represent the output. As the machine operates, the output q takes on the value 1 each time the input p takes on the value 1 after first taking on the value 0. Notice that under this interpretation, the automata is a Mealy machine[8]: The next state and the output symbol are both functions of the current state and the input symbol. Example 3: An Integrator The first two examples were discrete; all of the tapes were N traces. In contrast the third example is a continuous integrator; all of its tapes are R traces. It ....

G. H. Mealy. A method for synthesizing sequential circuits. Bell System Technical Journal, 34(5), May 1955.

....models and control is based on on line computational models. Off line models take a computational problem as a function from inputs to outputs; on line models take a computational problem as a process from input traces to output traces. Differential difference equations and Mealy Moore Machines [11, 12] are typical on line models. We have advocated instead a formal approach to modeling a robotic system consisting of the plant, the controller and the environment. Influenced by the Operator Net model [3] and the Temporal Automaton Model [7] we have developed an algebraic model, called Constraint ....

G. H. Mealy. A method for synthesizing sequential circuits. Bell Sys. Tech. Journal, 34:1045 -- 1079, 1955.

....models for continuous, discrete and event driven dynamic systems have been developed and matured. Models for continuous and discrete dynamic systems include differential and difference equations, respectively [Lue79, San90] Models for event driven dynamic systems include Mealy Moore Machines [Mea55, Moo56], Petri Nets [Pet81] Calculus for Communicating Systems (CCS) MM79] and Communicating Sequential Processes (CSP) Hoa85] However, a robotic system in general is a continuous discrete hybrid dynamic system. First, the plant and the environment of a robotic system are normally modeled in ....

....s 0 2 S as the initial state, f s : I Theta S S is a state transition function, O is the set of output values and f o is an output function. However, there are two ways to define an output function, corresponding to two types of input output automata, f o : I Theta S O for Mealy machines [Mea55] and f o : S O for Moore machines [Moo56] In a constraint net model, a Mealy or Moore machine is derived by selecting different output locations as the interface of its state automaton module. If we select fi; s 0 g as the interface of SA, then IOA is a Mealy machine with f s = f and f o = g ....

[Article contains additional citation context not shown here]

G. H. Mealy. A method for synthesizing sequential circuits. Bell Sys. Tech. Journal, 34:1045 -- 1079, 1955.

....fairness assumptions concerning the processes, i.e. a process may halt or operate in different speeds. In particular, processes can not detect whether other processes have halted. 2. 1 State Machine and Sequential Specification More formally, we model an object type using a Mealy state machine [Mea55] We use the notations of [AGMT92] to define a sequential specification via the Mealy machine. An object O shared by n processes can be specified via a state machine in which the state transitions are labeled by the invocations and responses of operations performed by the processes. Definition 1 ....

G. H. Mealy. A method for synthesizing sequential circuits. Technical Report 34, Bell Sys. Tech., September 1955.

....4: An input output automaton (s denotes either s or s 0 ) Second, modules provide a flexible way for generating different systems from the same set of components. To illustrate this idea, we again look at input output automata. There are two types of input output automata: Mealy machines [17] or Moore machines [19] In general, an input output automaton is a tuple hI; S; s 0 ; f s ; O; f o i where I is the set of input values, S is the set of states with s 0 2 S as the initial state, f s : I Theta S S is a state transition function, O is the set of output values and f o is an ....

G. H. Mealy. A method for synthesizing sequential circuits. Bell Sys. Tech. Journal, 34:1045 -- 1079, 1955.

...., c 2 , c m . bit vector v = b 1 , b 2 , b n , where b i is set if resource r i is used. the set of placement strings P = R 0, 1 d . We now formalize our definition of a P FSA for modeling placement. Since the P FSA produces output on transitions, we have a Mealy machine [MEAL55]. We define the P FSA as a sixtuple 2 M = Q, S, D, d, l, q 0 ) where: Q is the set of states with labels 0, 1 n 0, 1 d representing the allocation state of machine resources, the input alphabet S = C, is the set of selection criteria, the output alphabet D = P, is the set of ....

Mealy, G.H. A method for synthesizing sequential circuits, Bell System Technical Journal, 34(5):1045-- 1079, 1955.

....reader serv name j i 9 TSE doc Figure 2: Two finite state machines is another way to display the information represented by the left one. It contains only E nodes, but its transitions are labeled with the user action and the system reaction. This type of machine is called a Mealy automaton [28]. Note that nodes and transitions would have to be added to both machines to take account of readers other than Joe and documents other than TSE. If the sets of readers and documents are large, the result would be a huge machine. One could replace Joe and TSE by meta variables such as Name and ....

G. Mealy, "A Method for Synthesizing Sequential Circuits," Bell System Tech. J., vol. 34, no. 5, pp. 1045--1079, Sept. 1955.

....0 is the initial context identifying the name space within which names are to be resolved. ff is the access function defined for the naming network. Under the assumption that there exists a single naming network, Q; Sigma; ffi; and ff will be fixed. Naming automata are related to finite automata [Mealy 55, Moore 64, Hopcroft Ullman 79] The difference is that the result of applying a finite automaton is boolean, indicating whether the final context was accepting or non accepting, whereas a naming automaton returns the result of applying the access function to the final context. 14 q = q 1 q = ....

G. H. Mealy. A method for synthesizing sequential circuits. Bell System Technical Journal, 34(5):1045--1079, 1955.

....of the system. As an aid to understanding TLA formulas, we introduce here a type of picture called a predicate action diagram. These diagrams are similar to the various kinds of state transition diagrams that have been used for years to describe systems, starting with Mealy and Moore machines [5, 6]. We relate these pictures to TLA specifications by interpreting a predicate action diagram as a TLA formula. A diagram denoting formula D is a correct description of a system with specification S iff (if and only if ) S implies D. We therefore provide a precise statement of what it means for a ....

George H. Mealy. A method for synthesizing sequential circuits. Bell System Technical Journal, 34(5):1045--1079, September 1955.

...., c 2 , c m . bit vector v = b 1 , b 2 , b n , where b i is set if resource r i is used. the set of placement strings P = R 0, 1 d . We now formalize our definition of a P FSA for modeling placement. Since the P FSA produces output on transitions, we have a Mealy machine [Mea55]. We define the P FSA as a sixtuple 2 M = Q , S, D, d, l, q 0 ) where: Q is the set of states with labels 0, 1 n 0, 1 d representing the allocation state of machine resources, the input alphabet S = C, is the set of selection criteria, the output alphabet D = P, is the set ....

Mealy, G.H. A method for synthesizing sequential circuits, Bell System Technical Journal, 34(5):1045--1079, 1955.

....[Sel74a] SWF81] MM85] Mye86] Common Subsequence [Hir75] AHU76] HS77] NKY82] HL87] CP90] Ste92] Ukk85] Fic84] SK83] FS83] HD80] MP80] WSB76] WF74] Sel74b] Extended Reg. Exp. Pat. Matching [Hir89] HU79] MM89a] WS78] Wag74] Chapter 3 [HU79] Tho68] MY60] Moo56] Kle56] Mea55] CP92] Mye88] GG88] LV88] LV89] LVN89] GL89] CL90] Mye90] JTU91] BYP92] CL92] Figure 1.1: The various problems and solutions on discrete pattern matching of sequences. 11 The second half of the dissertation develops a new domain of problems called super pattern matching, or discrete ....

....and Kleene closure ( The symbol matches the empty string. For example, a (b j ) j c b denotes the set fab; a; c; cb; cbb; g. There have been many results solving the exact matching problem. Most of these involve the construction of a finite automaton used to perform the matching [Mea55, Moo56, MY60, Brz64, Tho68, HU79, BS86, CP92] The automaton construction algorithm presented below is used by Myers and Miller [MM89a] for their approximate matching solutions and is the construction used for the algorithms in Chapters 3, 4 and 6. Formally, this non deterministic finite ....

G. H. Mealy. "A Method for Synthesizing Sequential Circuits." Bell System Technical Journal 34 (September 1955), 1045--1079.

....of the system. As an aid to understanding TLA formulas, we introduce here a type of picture called a predicate action diagram. These diagrams are similar to the various kinds of state transition diagrams that have been used for years to describe systems, starting with Mealy and Moore machines [1], 2] We relate these pictures to TLA specifications by interpreting a predicate action diagram as a TLA formula. A diagram denoting formula D is a correct description of a system with specification S iff (if and only if) S implies D. We therefore provide a precise statement of what it means for ....

....x is always a natural number, hM 1 i hx;yi is always enabled. Hence, WF hx; yi (M 1 ) implies that there are infinitely many hM 1 i hx;yi steps, so x is incremented infinitely often. Similarly, WF hx; yi (M 2 ) implies that y is incremented infinitely E n v i r o n m e n t C E l e m e n t in[1] in[n] out . i j Fig. 2. A Muller C element. often. Putting this all together, we see that Phi is true of a behavior iff (i) x and y are initially zero, ii) every step increments either x or y by one and leaves the other unchanged or else leaves both x and y unchanged, and ....

[Article contains additional citation context not shown here]

G. H. Mealy, "A method for synthesizing sequential circuits," Bell System Technical Journal, vol. 34, pp. 1045--1079, Sept. 1955.

No context found.

Mealy, G. (1955), `A Method for Synthesizing Sequential Circuits', Bell System Technology J. 34, 1045--1079.

No context found.

G. Mealy, "A Method for Synthesizing Sequential Circuits," Bell System Technology J., vol. 34, pp. 1045--1079, 1955.

No context found.

Mealy, G. H. (1955). Method for synthesizing sequential circuits. Bell System Technical Journal, 34:1045--1079.

No context found.

G. H. Mealy. A method for synthesizing sequential circuits. Bell System Technical Journal, 35(5):1045--1079, 1955.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC