Topics
synchronizationChemical compound
International audienceThis paper studies synchronization between synchronous Finite State Machines (FSM). Properties of different synchronization schemes are proved by a formal tool. In particular we study the problem of computing simultaneously a condition and using it to determine a next state. The example is made of a control part and a data-path
In this paper we introduce concepts of a potential fault latency and a real fault latency for Finite...
Abstract Determining the state of a system when one does not know its current initial state is a ver...
Determining the state of a system when one does not know its current initial state is a very importa...
In this paper, we address the problem of setting a deterministic Finite State Machine (FSM) to a des...
In this paper, we address the problem of setting a discrete system specified as a Finite State Mac...
Finite State Machines (FSMs) are a convenient model for specification, analysis and synthesis of the...
A technique for the automated synthesis of FSMs (finite state machines) from sets of interworkings (...
Synchronizing sequences have been proposed in the late 60’s to solve testing problems on systems mod...
We have shown that it is possible to automatically synthesize the synchronization skeleton of a conc...
A method of a self-checking synchronous Finite State Machine (FSM) network design with low overhead ...
Abstract—A new method is proposed for improving the testa-bility of a finite state machine (FSM) dur...
We provide a survey of research surrounding the Černy� conjecture. This conjecture concerns fini...
Long version (submitted)A system of communicating finite state machines is synchronizable if its sen...
This paper studies the semantics of hierarchical finite state machines (FMS's) that are compose...
In this paper, we propose a generalized diagnostic algorithm for the case where more than one fault ...
In this paper we introduce concepts of a potential fault latency and a real fault latency for Finite...
Abstract Determining the state of a system when one does not know its current initial state is a ver...
Determining the state of a system when one does not know its current initial state is a very importa...
In this paper, we address the problem of setting a deterministic Finite State Machine (FSM) to a des...
In this paper, we address the problem of setting a discrete system specified as a Finite State Mac...
Finite State Machines (FSMs) are a convenient model for specification, analysis and synthesis of the...
A technique for the automated synthesis of FSMs (finite state machines) from sets of interworkings (...
Synchronizing sequences have been proposed in the late 60’s to solve testing problems on systems mod...
We have shown that it is possible to automatically synthesize the synchronization skeleton of a conc...
A method of a self-checking synchronous Finite State Machine (FSM) network design with low overhead ...
Abstract—A new method is proposed for improving the testa-bility of a finite state machine (FSM) dur...
We provide a survey of research surrounding the Černy� conjecture. This conjecture concerns fini...
Long version (submitted)A system of communicating finite state machines is synchronizable if its sen...
This paper studies the semantics of hierarchical finite state machines (FMS's) that are compose...
In this paper, we propose a generalized diagnostic algorithm for the case where more than one fault ...
In this paper we introduce concepts of a potential fault latency and a real fault latency for Finite...
Abstract Determining the state of a system when one does not know its current initial state is a ver...
Determining the state of a system when one does not know its current initial state is a very importa...
Add to ORKG