REPRESENTATIONS AND IDENTIFICATIONS OF STRUCTURAL AND MOTION STATE CHARACTERISTICS OF MECHANISMS WITH VARIABLE TOPOLOGIES

2006 ◽  
Vol 30 (1) ◽  
pp. 19-40 ◽  
Author(s):  
Hong-Sen Yan ◽  
Chin-Hsing Kuo
Keyword(s):  
Topological Structure ◽  
Topological Analysis ◽  
State Machines ◽  
Matrix Representations ◽  
Motion State ◽  
New Concepts ◽  
Synthesis Of Mechanisms ◽  
Analysis And Synthesis ◽  
Finite State ◽  
State Graphs

A mechanism that encounters a certain changes in its topological structure during operation is called a mechanism with variable topologies (MVT). This paper is developed for the structural and motion state representations and identifications of MVTs. For representing the topological structures of MVTs, a set of methods including graph and matrix representations is proposed. For representing the motion state characteristics of MVTs, the idea of finite-state machines is employed via the state tables and state graphs. And, two new concepts, the topological homomorphism and motion homomorphism, are proposed for the identifications of structural and motion state characteristics of MVTs. The results of this work provide a logical foundation for the topological analysis and synthesis of mechanisms with variable topologies.

scholarly journals Finite State Testing and Syntax Testing

2012 ◽  
Vol 3 (1) ◽  
pp. 48-54
Author(s):  
Amandeep Singh ◽  
Harmanjit Singh
Keyword(s):  
Practical Importance ◽  
Finite State Machines ◽  
Model Systems ◽  
Modular Organization ◽  
State Testing ◽  
State Machines ◽  
New Concepts ◽  
Finite State ◽  
New Applications ◽  
Advanced Computer

This paper is concerned with the testing of the software which is being developed in a structured way. The advantages which accrue from a well-structured or modular organization of software depend upon an ability to independently test a module well before the full development of all the modules with which it communicates. This paper describes techniques (Finite State Testing & Syntax Testing) which effectively test various applications. 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 state machines to ensure the correct functioning of systems and to discover aspects of their behavior. 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 have been studied in different areas and at various times. Some old problems which had been open for decades were resolved recently, new concepts and more intriguing problems from new applications emerge. 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 art. In addition, this paper covers syntax testing which is also called grammar based testing technique for testing various applications where the input data can be described formally.

A General Formula of Degree-of-Freedom for Parallel Manipulators and Its Application

2006 ◽  
Author(s):  
Ting-Li Yang ◽  
Dong-Jin Sun
Keyword(s):  
Characteristic Equation ◽  
Topological Structure ◽  
Topological Analysis ◽  
Parallel Manipulators ◽  
Characteristic Matrix ◽  
Parallel Mechanisms ◽  
Constraint Equations ◽  
Analysis And Synthesis ◽  
Dimension Type ◽  
Symbolic Operation

This paper presents a new DOF formula for mechanism Its main feature is that the calculation of mobility has a single value for a given mechanism without the set of constraint equations, each of parameters in the formula can be correctly determined by simple symbol operation. The formula shows the map relationship between DOF and topological structure of a mechanism. It is embodied in the following aspects: (1) Dimension type: so that topological structure of a mechanism can be represented by symbols. (2) Orientation and location characteristic matrix: so that rank of a mechanism can be calculated by symbolic operation. (3) Orientation and location characteristic equation of serial mechanism and its symbolic operation. (4) Orientation and location characteristic equation of parallel mechanism and its symbolic operation. (5) The DOF calculation based on orientation and location characteristic equations of serial and parallel mechanisms. The DOF formula presented in this paper has already been used for topological analysis and synthesis of parallel mechanisms and its advantages has been proven.

scholarly journals Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game

2017 ◽  
Author(s):  
Theodore Andronikos ◽  
Alla Sirokofskich ◽  
Kalliopi Kastampolidou ◽  
Magdalini Varvouzou ◽  
Konstantinos Giannakis ◽  
...  
Keyword(s):  
Game Theory ◽  
Quantum Computation ◽  
Finite Automata ◽  
State Machines ◽  
Quantum Game ◽  
Finite Games ◽  
New Concepts ◽  
Finite Game ◽  
Finite State ◽  
Deterministic Automata

The meticulous study of finite automata has produced many important and useful results. Automata are simple yet efficient finite state machines that can be utilized in a plethora of situations. It comes, therefore, as no surprise that they have been used in classic game theory in order to model players and their actions. Game theory has recently been influenced by ideas from the field of quantum computation. As a result, quantum versions of classic games have already been introduced and studied. The PQ penny flip game is a famous quantum game introduced by Meyer in 1999. In this paper we investigate all possible finite games that can be played between the two players Q and Picard of the original PQ game. For this purpose we establish a rigorous connection between finite automata and the PQ game along with all its possible variations. Starting from the automaton that corresponds to the original game, we construct more elaborate automata for certain extensions of the game, before finally presenting a semiautomaton that captures the intrinsic behavior of all possible variants of the PQ game. What this means is that from the semiautomaton in question, by setting appropriate initial and accepting states, one can construct deterministic automata able to capture every possible finite game that can be played between the two players Q and Picard. Moreover, we introduce the new concepts of a winning automaton and complete automaton for either player.

Sign in / Sign up

Export Citation Format

Share Document