Book•
Algebraic Structure Theory of Sequential Machines
01 Jan 1966-
About: The article was published on 1966-01-01 and is currently open access. It has received 571 citations till now. The article focuses on the topics: Algebraic structure.
Citations
More filters
Book•
01 Jan 1991TL;DR: Part 1 Basic: introduction protocol structure error control flow control and design tools: a protocol simulator a protocol validator using the validator.
Abstract: Part 1 Basic: introduction protocol structure error control flow control. Part 2 Specification and modeling: validation models correctness requirements protocol design finite state machines. Part 3 Conformance testing synthesis and validation: conformance testing protocol synthesis protocol validation. Part 4 Design tools: a protocol simulator a protocol validator using the validator.
1,655 citations
Cites background from "Algebraic Structure Theory of Seque..."
...For a more general introduction to the basic theory and its application to circuit design, refer to, for instance, Harrison [1965], Hartmanis and Stearns [1966], Kain [1972], Shannon and McCarthy [1956]. The ‘‘busy beaver problem’’ was introduced in Rado [1962] and further studied in Lin and Rado [1965]....
[...]
...For a more general introduction to the basic theory and its application to circuit design, refer to, for instance, Harrison [1965], Hartmanis and Stearns [1966], Kain [1972], Shannon and McCarthy [1956]....
[...]
01 Aug 1996
TL;DR: The fundamental problems in testing finite state machines and techniques for solving these problems are reviewed, tracing progress in the area from its inception to the present and the stare of the art is traced.
Abstract: With advanced computer technology, systems are getting larger to fulfill more complicated tasks: however, they are also becoming less reliable. Consequently, testing is an indispensable part of system design and implementation; yet it has proved to be a formidable task for complex systems. This motivates the study of testing finite stare machines to ensure the correct functioning of systems and to discover aspects of their behavior. A finite state machine contains a finite number of states and produces outputs on state transitions after receiving inputs. Finite state machines are widely used to model systems in diverse areas, including sequential circuits, certain types of programs, and, more recently, communication protocols. In a testing problem we have a machine about which we lack some information; we would like to deduce this information by providing a sequence of inputs to the machine and observing the outputs produced. Because of its practical importance and theoretical interest, the problem of testing finite state machines has been studied in different areas and at various times. The earliest published literature on this topic dates back to the 1950's. Activities in the 1960's mid early 1970's were motivated mainly by automata theory and sequential circuit testing. The area seemed to have mostly died down until a few years ago when the testing problem was resurrected and is now being studied anew due to its applications to conformance testing of communication protocols. While some old problems which had been open for decades were resolved recently, new concepts and more intriguing problems from new applications emerge. We review 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 stare of the art. In addition, we discuss extensions of finite state machines and some other topics related to testing.
1,273 citations
TL;DR: Today, as a step towards the control of complex dynamic systems, models are being used ubiquitously, being modelled, for instance, are the air traffic flows around New York, the endocrine balances of the pregnant sheep, and the flows of money among the banking centres.
Abstract: Today, as a step towards the control of complex dynamic systems, models are being used ubiquitously. Being modelled, for instance, are the air traffic flows around New York, the endocrine balances of the pregnant sheep, and the flows of money among the banking centres.
1,017 citations
Cites background from "Algebraic Structure Theory of Seque..."
...Hartmanis and Stearns (1966) definition of machine M’ being a homomorphism of M follows naturally....
[...]
Book•
01 Jan 1992TL;DR: In this paper, general properties of linear systems are discussed, and the geometric approach -analysis, synthesis, robustness optimality, and robustness optimization -are presented, respectively.
Abstract: Introduction to systems general properties of linear systems the geometric approach - analysis, synthesis, robustness optimality.
633 citations
TL;DR: This work uses dynamic Bayesian networks (with decision trees representing the local families of conditional probability distributions) to represent stochastic actions in an MDP, together with a decision-tree representation of rewards, and develops versions of standard dynamic programming algorithms that directly manipulate decision-Tree representations of policies and value functions.
443 citations
Cites background from "Algebraic Structure Theory of Seque..."
...Our structured versions of these algorithms will cluster together states that at each stage in the computation have the same estimated value or same optimal choice of action....
[...]