31 search results - page 3 / 7 » Synthesizing Converters Between Finite State Protocols |
FASE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
ICSE
2007
IEEE-ACM
14 years 1 months ago
2007
IEEE-ACM
Abstract. We describe an approach to designing and implementing a distributed system as a family of related finite state machines, generated from a single abstract model. Various a...
SICHERHEIT
2010
13 years 5 months ago
2010
Intrusion-tolerant replication enables the construction of systems that tolerate a finite number of malicious faults. An arbitrary number of faults can be tolerated during system ...
GI
2010
Springer
13 years 5 months ago
2010
Springer
: In this article, it is proven for finite systems that if by reciprocal interaction, one finite system determines the action of another finite system, then both systems become sub...
IOLTS
2009
IEEE
14 years 2 months ago
2009
IEEE
— The paper deals with designing fault tolerant finite state machines (FSMs) by nanoelectronic programmable logic arrays (PLAs). Two main critical parameters of the fault toleran...