Concrete and Tangible is the Right Test for Patent Eligibility
In 1998, the United States Court of Appeals for the Federal Circuit, in State Street Bank & Trust Co. v. Signature Financial Group, Inc., did away with what had previously been come to be known as the business method exception to patentability. The Federal Circuit, per Judge Giles Sutherland Rich (shown left), pointed out that the business method exception had never been invoked by either the Federal Circuit or its predecessor court, the CCPA. Judge Rich explained that “[s]ince the 1952 Patent Act, business methods have been, and should have been, subject to the same legal requirements for patentability as applied to any other process or method.”
Although the United States Supreme Court did away with that test when it issued its decision in Bilski v. Kappos, it is still nevertheless illustrative and the best test that is out there. Simply stated, in order to have a patentable business method, it is necessary for the invention to accomplish some practical application. In other words, in order for a business method to be patent eligible, it must produce a “useful, concrete and tangible result.” Judge Rich was correct to point this out and the Supreme Court has made a horrible mess of the law as it applies to business methods and computer-implemented innovations because it fails to understand what Judge Rich really meant.
If you really understand what Judge Rich meant by “useful, concrete and tangible result,” you come to the inescapable conclusion that it is the appropriate test. Indeed, those drafting patent application would do well to really target the description of the invention to satisfy the test.
PTAB Questions Machine-or-Transformation Claims
Just over three years ago, the United States Supreme Court issued its decision in Bilski v. Kappos. The critical question presented to the Court for consideration was whether the Federal Circuit erred by creating the so-called “machine or transformation” test, which requires a process to be tied to a particular machine or apparatus, or transform an article into a different state or thing, in order to be patentable subject matter. The Supreme Court held that the machine-or-transformation test is not the sole test for patent eligibility under §101, but is an important clue, thereby overruling the Federal Circuit who had earlier ruled that the machine or transformation test was the test to determine whether an invention is patentable subject matter.
But what practical effect has the Supreme Court ruling in Bilski v. Kappos had? Truthfully, not much. at least in terms of the day-to-day approach of patent attorneys and the U.S. Patent and Trademark Office. (Certainly, the decision was important in that it preserved the patentability of at least some business methods and preserved the patentability of software.)
While the machine-or-transformation test is now only an important clue, it really has become a safe harbor for practitioners. The assumption has been that you satisfy the machine-or-transformation test announced by the Federal Circuit and you have a patentable invention. Fail to satisfy the machine-or-transformation test and you may have a patentable invention, but neither the Patent Office nor any court has yet found an invention that failed the machine-or-transformation test to be patentable.
08.28.13 | Business Method Patents, Patent Issues, software patents, USPTO | Gene Quinn
Patent Drafting: Defining Computer Implemented Processes
The following post was written by Gene Quinn , of IPWatchdog and Practice Center Contributor.
The United States Patent and Trademark Office is radically updating the Patent Bar Examination starting in April 2011. Since I teach the PLI Patent Bar Review Course that has required John White and I to revise our materials. One of the new things tested will be the recently released 112 Guidelines, which are full of great information and explanation, particularly relating to computer implemented processes; what many would call software. Being the “software guy” one of my responsibilities has been to work on the 112 Guidelines and the Bilski Guidelines for the PLI course. So I thought I would take this opportunity to write, once again, about how to disclose computer implemented inventions to satisfy the disclosure requirements, which are embodied specifically in 35 U.S.C. § 112.
The statutory requirements for computer-implemented inventions are the same as for all inventions. That means that in order to be patentable the invention must meet the patent eligibility test in 35 U.S.C. § 101, the invention must be new (§ 102), it must be non-obvious (§ 103) and it must be adequately described (§ 112). Since the United States Supreme Court announced its decision in Bilski v. Kappos, the United States Patent and Trademark Office has continually urged patent examiners to get beyond the § 101 inquiry except in extreme cases. Prior to the Supreme Court’s Bilski decision many examiners would simply see a computer-implemented method and issue a blanket and rather non-specific rejection asserting that the invention was not patent eligible subject matter under § 101. The USPTO focus on getting past § 101 and to the meat of the invention means that such rejections are no longer the norm. It also means that the Patent Office is pushing the real question about whether an patentable invention is presented into the adequate description space pursuant to § 112. Thus, a thorough and complete description is absolutely essential when your invention relates to a computer-implemented method, whether it is software, an Internet processes or a business method. (more…)
03.15.11 | PLI Patent Bar Review Course, written description | Stefanie Levine
Institute Live Blog: Reactions To Bilski
Next panel – “What Hath Bilski v. Kappos: Fallout in the Courts and the USPTO”. The panel includes, Gary Hoffman of Dickstein Shaprio, David M. Rosenblatt of Thomson Reuters and Associate Prof. Michael Risch of Villanova School of Law.
– Gary Hoffman began with a discussion on how the Courts have reacted to Bilski. The Federal Circuit has cited Bilski 7 times: 2 cases with substantive post-Bilski analysis: Prometheus (Court held MOT test is relevant but not the only test) & Research Corp. Tech (Court focused on whether the subject matter fails s 101’s requirement that it not be “abstract”); 2 references to the recency of the decision, 1 citation to the Supreme Court’s instruction that formulaic rules should be avoided, 1 metnion in dissent (Intervet), 1 case (King Pharma) where s101 analysis was passed over because the Fed Circ had already found the claims anticipated. (more…)
02.17.11 | Bilski, Patent Law Institute, posts | Stefanie Levine
No Comments
02.3.14 | Business Method Patents, CAFC, Patent Issues, posts, software patents | Gene Quinn