| [ freeeXpression ] in KIDS 글 쓴 이(By): yoke (하일수) 날 짜 (Date): 1994년07월01일(금) 02시50분02초 KDT 제 목(Title): IBM Finite State Machine의 특허 받다!!! 아라의 InfoWorld 게시판에서 긁어 옵니다. 으. X 되었당!!! 보낸이 (From) : vince (비니) 시 간 (Date) : 1994년07월01일(금) 2시18분44초 제 목 (Title) : IBM Finite State Machine의 특허 받다!!! USPO(United States Patents Office)에서 지난주/이번주 사이에 IBM에 Finite State Machine에 대한 특허권(Patent)을 인정 했습니다. 맛이 가는 세상. 변호사들이 세상을 말아먹는 날이 곧 오고야 말지도 모르겠군요. 다음의 메시지를 참고하시압! -비니 -- To: ietf@CNRI.Reston.VA.US Subject: IBM awarded patent on finite state machines Date: Thu, 30 Jun 94 08:14:46 PDT Sender: ietf-request@IETF.CNRI.Reston.VA.US I try to avoid reading U.S. patent awards because it seems like every time I do I have to be tranquilized & restrained. But this just came in the mail & it's even worse than usual. Does anyone know what planet USPO inspectors come from? Can we make them go back there or do we have to wait until they finish destroying western civilization? - Van ps - it seems like the `novelty' in this award is associating a list of actions with an accepting state rather than a single action. I thought this was a good, though obvious, idea in 1961 when I first saw it in Kleene's paper on finite automata. As I recall, Kleene saw the idea in the 1943 McCulloch & Pitts paper on modeling neuron activity via FSMs. So 50 years later the USPO credits this `remarkable discovery' to IBM. Arrrgh. ------- Forwarded Message Date: Wed, 29 Jun 1994 13:29:57 -0400 From: Wendell Craig Baker <wbaker@splat.baker.com> Subject: The Finite State Machine has been patented Every week, Gregory Aharonian (patents@world.std.com) mails out a list of newly-minted patents. Every week I gaze over it and there is always some few distinguished ones that just stand out and beg for a wider audience. This is but one this week. And as with football, you make the call. Patent 05317757, on its face, covers any use of a finite state machine. Although the word ``software'' is not actually used in the patent, the words ``code'' and ``process'' and the general tone of the patent imply that a software implementation is what is intended. Claim number one focuses on any use of a finite state machine whatsoever, making no mention of the intended use of such a structure. Claim 2 focuses on finite state machines with two actions in the next-state computation. Later claims add a third action. The early part of the patent reads suspiciously like someone was trying to patent the finite state machines used in a network protocol stack. As examples one can think of of TCP/IP, DECnet or SNA. Interestingly it is just this year that the term ``protocol stack'' has gained currency, especially in the PC community where many PC owners are attempting to get access to the Internet which is TCP/IP-based. ``Which protocol stack are you using? Is it a an open or closed one (general or proprietary)?'' was heard much on the exhibits floor of Internet World. If one can buy them at the corner store with a range of choices, then finite state machines in software and networking code in particular are definitely not a new invention. Later on in the patent text we find explicit mention of IBM's Advanced Peer-to-peer Network (APPN) protocol. This is a general patent on finite state machines originating from the software design of IBM's APPN networking product. The intended goals of the patent, or ``objects'' as they are called in patentese, are quite general. The ``objects'' of the patent are not the ``claims'' but rather a listing of but why the patent is a useful or non-trivial invention. They are a sort of description of how it is intended to be used. They are as follows: 1. to efficiently perform finite state machine processing in a system that is servicing multiple types of resources. 2. to perform finite state machine processing in a system having multiple resources running under different concurrent processes. 3. to perform finite state machine processing in a system, implemented in a minimum code space. 4. to perform finite state machine processing in a system, that provides for ease of maintenance 5. to provide finite state processing in a system, so that the implementations are tailored for each resource. 6. to perform finite state machine processing in a system, while maintaining modularity of the design. So, if you have a system that needs functionalities one through six, then you had better examine this patent with special attention to claim 1. Number: 05317757 Title: System and method for finite state machine processing using action vectors Issue Date: May 31, 1994 Filing Date: Feb 6, 1992 Inventors: John A. Medicke; Paul Posharow; Assignee: International Business Machines Corporation Here's the abstract so you won't have to dig through the whole thing. Abstract A common set of building block action modules perform specific tasks in the finite state machine and are strongly modular in structure. The set of building block action modules can be made up of modules for tasks generic to resource type and modules that are resource type independent. A finite state machine is created for each resource type to govern the steps of activation and deactivation of the resource. Each finite state machine, uniquely defines the new state and action processing for each resource type. To tie the building block action modules to each finite state machine, action vectors are created for each resource type. The action vector correlates a particular action selection by the finite state machine to the dispatching of one or more building block action modules. An action vector can contain a plurality of elements. Each of these elements identifies an action module to which control is passed and a function request pointer. The function pointer identifies the specific function to be performed by the designated action module. The building block action modules are invoked in the order of occurrence of the elements in the action vector. I wonder what this means for TCP/IP. Hey, does your stack violate this patent? W. Source: ftp://ftp.town.hall.org/patent/data1/05317/05317757 - ------------------------------------------------------------------------------ - -----BEGIN PRIVACY-ENHANCED MESSAGE----- Proc-Type: 2001,MIC-CLEAR Originator-Name: keymaster@town.hall.org Originator-Key-Asymmetric: MFkwCgYEVQgBAQICAgADSwAwSAJBALeWW4xDV4i7+b6+UyPn5RtObb1cJ7VkACDq pKb9/DClgTKIm08lCfoilvi9Wl4SODbR1+1waHhiGmeZO8OdgLUCAwEAAQ== MIC-Info: RSA-MD5,RSA, Jj0l+5Sw/MYMeaTA712/z4bbHj2XZRUSKHTBGQhSq1q8Af3Ig2CUF3RCz9nhfdUy QVX86LaI+43Gjtllz2kW8w== 요기부턴 짜릅니다. 직접 가서 확인하시죠. 맛이 가죠? -- 최우형, 전산학과 석사1년 |