Results 241 to 250 of about 481,884 (278)
Some of the next articles are maybe not open access.
2004
A finite-state machine is a mathematical model of a special type of systems. One of the possible practical implementations of finite-state machines are sequential circuits. We study first sequential circuits, and then we generalize these concepts to finite-state machines.
Christian Posthoff, Bernd Steinbach
openaire +2 more sources
A finite-state machine is a mathematical model of a special type of systems. One of the possible practical implementations of finite-state machines are sequential circuits. We study first sequential circuits, and then we generalize these concepts to finite-state machines.
Christian Posthoff, Bernd Steinbach
openaire +2 more sources
On Communicating Finite-State Machines
Journal of the ACM, 1983Summary: A model of communications protocols based on finite-state machines is investigated. The problem addressed is how to ensure certain generally desirable properties, which make protocols ``well-formed,'' that is, specify a response to those and only those events that can actually occur. It is determined to what extent the problem is solvable, and
Brand, Daniel, Zafiropulo, Pitro
openaire +2 more sources
Model matching for finite state machines
Proceedings of 1994 33rd IEEE Conference on Decision and Control, 2001The problem of model matching has been previously considered for linear (see \textit{B. Moore} and \textit{L. Silverman} [ibid. 17, 491-497 (1972; Zbl 0263.93033)], \textit{A. S. Morse} [ibid. 18, 346-354 (1973; Zbl 0264.93005)]) and nonlinear (\textit{M. D. Di Benedetto} [ibid. 35, 1351-1355 (1990; Zbl 0734.93039)], \textit{A. Isidori} [ibid.
DI BENEDETTO, MARIA DOMENICA +2 more
openaire +5 more sources
2001
Finite state machines [49, 67] provide a visual representation of algorithms. Algorithms are implemented on a machine with a finite number of states representing the state of the algorithm. This provides an abstract way of designing algorithms. The chapter will only cover deterministic machines (the actions of the machines are determined uniquely).
Yorick Hardy, Willi-Hans Steeb
openaire +1 more source
Finite state machines [49, 67] provide a visual representation of algorithms. Algorithms are implemented on a machine with a finite number of states representing the state of the algorithm. This provides an abstract way of designing algorithms. The chapter will only cover deterministic machines (the actions of the machines are determined uniquely).
Yorick Hardy, Willi-Hans Steeb
openaire +1 more source
Modeling Finite State Machines
2019In this chapter, we will look at modeling finite state machines (FSMs). An FSM is one of the most powerful circuits in a digital system because it can make decisions about the next output based on both the current and past inputs. Finite state machines are modeled using the constructs already covered in this book.
openaire +1 more source
Korean Journal of Computational & Applied Mathematics, 1996
In this paper we introduce the notions of aTL-finite state machine,TL-retrievability,TL-separability,TL-connectivity and discuss their basic properties.
Jae-Gyeom Kim +2 more
openaire +1 more source
In this paper we introduce the notions of aTL-finite state machine,TL-retrievability,TL-separability,TL-connectivity and discuss their basic properties.
Jae-Gyeom Kim +2 more
openaire +1 more source
Modelling with Finite State Machines
2011Our discussion thus far of the object-oriented software construction process has focused on the use case model. While this is a comprehensive technique that finds widespread application, it is inadequate for handling situations where the operations cannot be modeled by end-to-end use cases.
Brahma Dathan, Sarnath Ramnath
openaire +1 more source
Journal of Intelligent & Fuzzy Systems, 2015
Abstract Concept of soft finite state machine is being introduced, which is based on soft set theory. Concepts of soft successor and soft immediate successor are introduced and some of their properties are studied. Notions of soft subsystem, soft submachine are given here. Finally direct product of soft machines is studied.
Hussain, Asim, Shabbir, Muhammad
openaire +1 more source
Abstract Concept of soft finite state machine is being introduced, which is based on soft set theory. Concepts of soft successor and soft immediate successor are introduced and some of their properties are studied. Notions of soft subsystem, soft submachine are given here. Finally direct product of soft machines is studied.
Hussain, Asim, Shabbir, Muhammad
openaire +1 more source
Periodic Finite-State Machines
10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'07), 2007Finite state machine (FSM) models are widely used to model the operations of computer systems. Since the basic FSM model is timeless, it is not possible to model within the basic FSM framework system properties that are dependent on the progression of real time, such as the duration of computations or the limited temporal validity of real-time data. To
H. Kopetz +3 more
openaire +1 more source
Codesign Finite State Machines
2001This chapter describes in detail Codesign Finite State Machines (CFSMs), the formal model used in POLIS for specification, simulation, analysis, synthesis, and optimization. It is also the model of computation that we used to demonstrate our formal verification methodology and equivalence analysis algorithms.
Harry Hsieh +2 more
openaire +1 more source