JP4570087B2 - Commuter pass route data confirmation system - Google Patents
Commuter pass route data confirmation system Download PDFInfo
- Publication number
- JP4570087B2 JP4570087B2 JP2005083269A JP2005083269A JP4570087B2 JP 4570087 B2 JP4570087 B2 JP 4570087B2 JP 2005083269 A JP2005083269 A JP 2005083269A JP 2005083269 A JP2005083269 A JP 2005083269A JP 4570087 B2 JP4570087 B2 JP 4570087B2
- Authority
- JP
- Japan
- Prior art keywords
- station
- simulator
- commuter pass
- data
- company
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Ticket-Dispensing Machines (AREA)
- Devices For Checking Fares Or Tickets At Control Points (AREA)
Description
本発明は各社の定期券発行機で生成される経路データの確認するシステムに関する。 The present invention relates to a system for confirming route data generated by a commuter pass issuing machine of each company.
定期券には、券面印字の他に発駅−経由駅−着駅のエンコード情報が記録されている。エンコード情報について説明すると、各社の全路線にはそれぞれ異なる線区コードが割り当てられ、各線区の駅には駅順コードが割り当てられている。例えば、東海道線の線区はＡＡ、東京駅から神戸駅まで順に駅順コードがＮ 1 、Ｎ 2 ……Ｎ 253 と割り当てられており、東京駅はＡＡ−Ｎ 1 、有楽町駅はＡＡ−Ｎ 2 、新橋駅はＡＡ−Ｎ 3 のように駅コード（駅番号）が割り当てられる。このように、各社の全路線の全駅は異なる駅番号が付されており、定期券の経路はこの駅コードで特定され、この駅コードが定期券に記録されている。 In the commuter pass, the encoded information of the departure station-passing station-arrival station is recorded in addition to the printing of the ticket surface. The encoding information will be described. Different line codes are assigned to all routes of each company, and station order codes are assigned to the stations of each line. For example, line section of the Tokaido Line is AA, the station order code in the order from Tokyo Station to Kobe Station N 1, N 2 ...... N 253 and is assigned, the Tokyo Station AA-N 1, Yurakucho Station AA-N 2, Shimbashi station the station code (Station ID) is assigned as AA-N 3. Thus, all stations on all routes of each company are assigned different station numbers, and the route of the commuter pass is specified by this station code, and this station code is recorded on the commuter pass.
経路を指定して各メーカの発行機で定期券を発行したとき、各定期券の運賃・キロ程が違っては問題となるため、現在は定期券突合シミュレータにより各定期券の運賃・キロ程を突合し、同じ最短最安の経路が生成されるようにしている。 When a commuter pass is issued by each manufacturer's issuing machine with the route specified, it will be a problem if the fare / km of each commuter pass is different. The same shortest and cheapest route is generated.
ところで、定期券を使用して経路外に乗り継いだ場合の運賃は、駅コードと降車駅とから決まるキロ程により算出される。従来の定期券突合シミュレータでは運賃・キロ程の突合のみ行っているため、エンコード（経路データ）の不備により、種々の運賃誤収受が発生している。例えば、図４に示すように、Ａ駅−Ｂ駅間の定期券を発行する場合を想定する。この場合、Ａ駅−Ｃ駅−Ｂ駅、Ａ駅−Ｄ駅−Ｂ駅のように異なる経路が並走し、最短最安経路がＡ駅−Ｃ駅−Ｂ駅としたとき、Ｍ社定期券発行機のエンコードがＡ駅−Ｃ駅−Ｂ駅、Ｎ社定期券発行機のエンコードがＡ駅−−−Ｂ駅であるとする。このような定期券エンコードの違いは各社の発行機設計思想の違いにより現実に生じている。そして、この定期券でＡ駅乗車し、Ｄ駅降車すると、Ｍ社発行の定期券では、例えばＣ駅−Ｄ駅間の不足金額を払わなければならず、Ｎ社発行の定期券は、そのまま降車可能となり、判定に差異が生じる可能性がある。 By the way, the fare when using a commuter pass to transfer outside the route is calculated based on the distance determined by the station code and the getting-off station. In the conventional commuter pass match simulator, only the fare / kilometer match is performed, and various fare misreceptions occur due to incomplete encoding (route data). For example, as shown in FIG. 4, the case where the commuter pass between A station and B station is issued is assumed. In this case, when different routes run in parallel, such as A station-C station-B station, A station-D station-B station, and the shortest and cheapest route is A station-C station-B station, M company Assume that the encoding of the ticket issuing machine is A station-C station-B station, and the encoding of the N company commuter pass issuing machine is A station --- B station. Such differences in commuter pass encoding actually occur due to differences in the issuing machine design philosophy of each company. And if you get on the A station with this commuter pass and get off at the D station, with the commuter pass issued by M company, you have to pay the shortage amount between C station and D station, for example. It is possible to get off the vehicle, and there is a possibility that the judgment will differ.
このことは運賃・キロ程だけ突合したのではＣ駅をエンコードしているか否かの違いによる誤収受をなくすことができないことを示している。そして、近年、首都近郊で検討されている一枚のＩＣカードで複数社線を自由に乗り継げるようにした場合、各社の定期券発行機のエンコードの違いは一層問題になる。 This indicates that misreception due to the difference in whether or not the station C is encoded cannot be eliminated if only the fare / km distance is met. In recent years, when one IC card, which is being studied in the suburbs of the capital, can be used to freely connect multiple company lines, the difference in the encoding of commuter pass issuing machines of each company becomes even more problematic.
本発明は上記課題を解決しようとするもので、定期券エンコード不備による運賃誤収受を防止するとともに、過剰にエンコードされていて問題の生じない場合は救済できるようにすることを目的とする。
本発明は、想定し得る可能な限りの定期券経路データを生成する手段、及び生成した定期券経路データを各社の定期券発行シミュレータに読み込んで、それぞれの発着駅経由駅の運賃・キロ程データを生成し、各社の定期券発行シミュレータが出力する運賃・キロ程データを突合する手段からなる運賃・キロ程突合部と、前記運賃・キロ程突合部における突合の結果不一致のものがあれば修正して任意の経路に対して運賃・キロ程を一致させた各社の定期券発行シミュレータに対して入力する任意の発駅−着駅データを生成する手段、及び生成した任意の発駅−着駅データを各社の定期券発行シミュレータに読み込んで経路データを生成し、各社の定期券発行シミュレータから出力される経路データを突合する手段からなる経路データ突合部とを有する定期券突合シミュレータと、各社の定期券発行シミュレータの処理ロジックを搭載し、前記定期券突合シミュレータによる突合の結果、一致のとれない経路データが出たとき、その経路データを読み込んで前記処理ロジックに違いがあるか否かを検証するロジックシミュレータとを備え、前記ロジックシミュレータは、分岐駅、交叉駅でないエンコードデータが過剰に登録されている場合は、問題のないデータと判定することを特徴とする。
An object of the present invention is to solve the above-mentioned problems, and it is an object of the present invention to prevent erroneous receipt of fares due to imperfect commuter pass encoding and to be able to remedy when there is no problem due to excessive encoding.
The present invention is a means for generating commuter pass route data as much as possible, and the generated commuter pass route data is read into a commuter pass issuance simulator of each company, and the fare / km data of each station via the station If there is a mismatch between the fare / km section that consists of means for matching the fare / km data output by the commuter pass issuance simulator of each company and the fare / km section And a means for generating arbitrary departure station-arrival station data to be input to a commuter pass issuance simulator of each company whose fare / km distance is matched to an arbitrary route, and the generated arbitrary departure station-arrival station A route data matching unit consisting of means to load route data output from each company's commuter pass issuance simulator by reading the data into the commuter pass issuance simulator of each company The processing logic of the commuter pass simulator and the commuter pass issuance simulator of each company is installed, and when the route data that cannot be matched is obtained as a result of the match by the commuter pass simulator, the route data is read and the processing is performed. A logic simulator that verifies whether or not there is a difference in logic, and the logic simulator determines that there is no problem when encoded data that is not a branch station or a crossing station is excessively registered. And
本発明によれば、各社の定期券発行機シミュレータの任意の経路に対する運賃・キロ程を突合して一致させ、この処理により運賃・キロ程から経路を特定することを可能にし、さらに同一経路に対して経路データの突合を行うことにより、エンコードの不一致を解明することができるので、エンコード不備による運賃誤収受を防止することができ、さらに分岐駅、交叉駅でないエンコードデータが過剰に記録されていて不一致が生じている場合は、運賃誤収受のような問題を生じないのでこれを救済することができる。 According to the present invention, it is possible to match and match the fare / km distance for an arbitrary route of each company's commuter pass issuer simulator, and it is possible to specify the route from the fare / km distance by this process, and for the same route By matching the route data, it is possible to elucidate the mismatch of encoding, so it is possible to prevent fare misreception due to incomplete encoding, and there is excessive recording of encoded data that is not a branch station or a crossing station. If there is a discrepancy, it can be remedied because it does not cause a problem such as wrong fare collection.
以下、本発明の実施の形態について説明する。
図１は本発明の定期券経路データ確認システム構成を説明する図である。
本システムでは、第１段階で各社の定期券発行機シミュレータのキロ程を突合させる処理を行う。この処理は、まず定期券突合シミュレータ１により、Ａ駅−Ｃ駅−Ｄ駅のような発着経由データを生成して入力ファイル（１）を作成する（原票データ）。このデータは想定し得る可能な限りの定期券経路データである。次いで、これらの経路データを各社の定期券発行機シミュレータ２に読み込んで、それぞれの発着駅経由駅の運賃・キロ程を生成して出力ファイル（１）を作成する。そして、定期券突合シミュレータ１に出力ファイル（２）のデータを読み込み、各社の定期券発行機シミュレータ２が出力する運賃・キロ程のデータを突合する。突合の結果、不一致のものがあれば各社の定期券発行機シミュレータ２を修正（例えば、不一致が生じた発着駅経由駅の経路における駅間キロ程の修正等）し、この処理を全データが一致するまで行う。
Embodiments of the present invention will be described below.
FIG. 1 is a diagram illustrating the configuration of a commuter pass route data confirmation system according to the present invention.
In this system, in the first stage, the process of matching the kilometer of the commuter pass issuer simulator of each company is performed. In this process, first, the commuter pass matching simulator 1 generates the arrival / departure data such as A station-C station-D station and creates the input file (1) (original data). This data is as much as possible commuter pass route data. Next, these route data are read into the commuter pass issuing machine simulator 2 of each company, and the fare / km distance of each station via the station is generated and an output file (1) is created. Then, the data in the output file (2) is read into the commuter pass matching simulator 1, and the data on the fare / km output from the commuter pass issuer simulator 2 of each company is matched. If there is a mismatch as a result of the match, the commuter pass issuer simulator 2 of each company is corrected (for example, correction of the distance between stations in the route of the station via the departure / arrival station where the mismatch occurred). Repeat until they match.
任意の経路に対して各社の定期券発行機シミュレータが生成する運賃キロ程が一致したとき、第２段階として経路データの突合処理を行う。この処理は、まず定期券突合シミュレータ１で任意の発駅−着駅データを生成して入力ファイル（２）を作成し、このデータを各社の定期券発行機シミュレータ２に読み込んで、経路データ（エンコードデータ）を生成して出力ファイル（２）を作成する。ついで、このデータを定期券突合シミュレータ１に読み込み、定期券経路データを突合し、エンコードが同じか否か判定する。 When the fare kilometer generated by the commuter pass issuer simulator of each company matches an arbitrary route, route data matching processing is performed as a second stage. In this process, first, the commuter pass matching simulator 1 generates arbitrary departure / arrival station data, creates an input file (2), reads this data into the commuter pass issuer simulator 2 of each company, and routes data ( (Encoded data) is generated and an output file (2) is created. Next, this data is read into the commuter pass matching simulator 1 and the commuter pass route data is checked to determine whether or not the encoding is the same.
この経路データ突合処理で不一致の経路データが出た場合には、その経路についてロジックシミュレータ３に読み込ませて各社の定期券発行機シミュレータ２のプログラムのミス等があるか否かを解析する。ロジックシミュレータは、各社の発行機シミュレータの処理ロジックを搭載し、いろいろな経路パターンを設定したテスト券を入力して処理を実行させ、その処理ロジックに違いがあるか否かを検証するためのものである。これは、本来、同じ処理を行う駅務機器は全て同じ処理結果を出力すべきであるが、現実には異なる会社で作製されたもの、異なる路線に配置されたもの等においては少しの設計思想の違いから同じ処理結果とならない場合があるため、これを検証するためのロジックシミュレータが開発されている。 When inconsistent route data is output in this route data matching process, the route is read into the logic simulator 3 to analyze whether there is a program error in the commuter pass issuer simulator 2 of each company. The logic simulator is equipped with the processing logic of the issuing machine simulator of each company, and is used to verify whether there is a difference in the processing logic by inputting a test ticket with various route patterns and executing the processing. It is. This is because all station equipment that performs the same processing should output the same processing result, but in reality it is a little design philosophy when it is manufactured by a different company or placed on a different route. Because of the difference, there are cases where the same processing result is not obtained, a logic simulator for verifying this has been developed.
なお、経路データ（エンコード）として分岐駅、交叉駅等でないデータが原因で経路データの突合処理で不一致が生じた場合、なにら問題を生じることがない。そこで、ロジックシミュレータ３では、分岐駅や交叉駅等でないエンコードが過剰に登録されている場合は問題はないケースとして判定し、救済する。 It should be noted that there is no problem if there is a mismatch in the route data matching process due to data that is not a branch station, a crossing station, or the like as route data (encoding). Therefore, the logic simulator 3 determines that there is no problem when an encoding that is not a branch station, a crossing station, or the like is excessively registered, and relieves.
次に、定期券突合シミュレータによる処理について説明する。
現状の定期券発行機で、発駅−着駅を指定し経路データ（エンコード）を生成させると、次のような２通りの方式で経路を生成する。
（１）最短最安順に経路を生成する方式
（２）事前に都度設定（売れ筋順）された順に経路を生成する方式
図２に示すように発駅がＡ駅、着駅がＢ駅で、その間に２つの経路が並走し、各経路にＣ駅、Ｄ駅が存在した場合、Ａ駅−Ｂ駅間には図示するようにＡ駅−Ｃ駅−Ｂ駅（１１キロ）（図２（ａ））、Ａ駅−Ｄ駅−Ｂ駅（１４キロ）（図２（ｂ））、Ａ駅−Ｃ駅−Ｄ駅−Ｂ駅（２０キロ）（図２（ｃ））、Ａ駅−Ｄ駅−Ｃ駅−Ｂ駅（２１キロ）（図２（ｄ））の４経路が考えられる。
Next, processing by the commuter pass match simulator will be described.
When the current commuter pass issuance machine designates the departure station and the arrival station and generates the route data (encode), the route is generated by the following two methods.
(1) A method of generating routes in the shortest and cheapest order (2) A method of generating routes in the order set in advance (in order of sales) As shown in FIG. 2, the departure station is A station, the arrival station is B station, In the meantime, two routes run side by side, and if there are C station and D station on each route, between station A and station B, station A-station C-station B (11 km) (Figure 2) (A)), A station-D station-B station (14 km) (Fig. 2 (b)), A station-C station-D station-B station (20 km) (Fig. 2 (c)), A station There are four possible routes:-D station-C station-B station (21 km) (Fig. 2 (d)).
図３はＡ駅−Ｂ駅間の定期発行をＡ社、Ｂ社、Ｃ社の定期発行シミュレータで生成した例を示しており、図３（ａ）に示すように、Ａ社シミュレータは最短・最安順に生成し、Ｂ社シミュレータは売れ筋順に生成し、Ｃ社は経由駅のエンコードを省略して発行している。これら各社の生成した経路データ（エンコード）を突合するためには、同じ経路（発駅、着駅、経由駅）同士のデータを突合させなければならない。しかし、図３（ａ）で分かるように、経路が複数存在する場合には単純に、発駅、着駅、経由駅で経路を特定しても、Ｃ社のようにエンコードを省略している場合、突合すべき経路が特定されない。そこで、まず、運賃・キロ程を突合して各社の定期券発行シミュレータのキロ程を一致させる必要がある。駅間キロは１００ｍ単位で登録されているため、異なる会社では経路によっては同じ駅間であってもキロ程が異なる場合が存在するので、このような違いを全て修正するために、任意の経路における駅間キロを突合させる。こうして運賃・キロ程を一致させることにより同一経路を特定することができる。 FIG. 3 shows an example in which the periodic issuance between station A and station B is generated by the periodic issuance simulators of company A, company B and company C. As shown in FIG. They are generated in the lowest order, the B company simulator is generated in the selling order, and the C company is issued with the encoding of the transit station omitted. In order to match the route data (encoding) generated by these companies, the data of the same route (source station, destination station, transit station) must be matched. However, as can be seen in FIG. 3 (a), when there are a plurality of routes, encoding is omitted as in the case of Company C even if the route is simply specified at the departure station, arrival station, and transit station. In this case, the route to be matched is not specified. Therefore, it is necessary to first match the fare / km distance to match the mileage of the commuter pass issuing simulator of each company. Because the distance between stations is registered in units of 100 meters, depending on the route, different companies may have different distances even between the same station. In order to correct all such differences, any route Reconcile the distance between stations. Thus, the same route can be specified by matching the fare / km distance.
図３（ｂ）においては、１１キロ、１４キロ、２０キロ、２１キロの経路は同一経路として、これらを突合して経路データ（エンコード）を突合させる。図３（ｂ）では、Ａ社シミュレータとＢ社シミュレータのエンコードは一致しているが、Ｃ社シミュレータのエンコードは一致していない。これを図１のロジックシミュレータ３で解析することにより、Ｃ社シミュレータのプログラムミス等をチェックして修正をかける。 In FIG. 3B, the routes of 11 km, 14 km, 20 km, and 21 km are regarded as the same route, and the route data (encode) is matched by matching these routes. In FIG. 3B, the encodings of the company A simulator and the company B simulator are identical, but the encodings of the company C simulator are not identical. This is analyzed by the logic simulator 3 in FIG. 1 to check and correct a program error of the C company simulator.
このように、各社の定期券発行機シミュレータの任意の経路に対する運賃・キロ程を突合して一致させ、この処理により運賃・キロ程から経路を特定することを可能にし、次いで同一経路に対して経路データの突合を行うことにより、エンコードの不備を解明することができるので、エンコード不備による運賃誤収受を防止することができる。 In this way, it is possible to match the fare / kilometer distance for any route of the commuter pass issuer simulator of each company and to identify the route from the fare / kilometer distance by this process, and then route to the same route By performing the data matching, it is possible to clarify the deficiency of the encoding, and thus it is possible to prevent the erroneous receipt of the fare due to the deficiency of the encoding.
本発明によれば、エンコード不備による運賃誤収受を防止し、かつ問題のない過剰なエンコードが登録されているケースは救済できるので産業上の利用価値は極めて大きい。 According to the present invention, it is possible to prevent erroneous receipt of a fare due to imperfect encoding, and it is possible to remedy a case where an excessive encoding without any problem is registered, so that the industrial utility value is extremely large.
１…定期券突合シミュレータ、２…各社の定期券発行シミュレータ、３…ロジックシミュレータ。 1 ... commuter pass matching simulator, 2 ... commuter pass issuance simulator of each company, 3 ... logic simulator.
Claims (1)
各社の定期券発行シミュレータの処理ロジックを搭載し、前記定期券突合シミュレータによる突合の結果、一致のとれない経路データが出たとき、その経路データを読み込んで前記処理ロジックに違いがあるか否かを検証するロジックシミュレータとを備え、
前記ロジックシミュレータは、分岐駅、交叉駅でないエンコードデータが過剰に登録されている場合は、問題のないデータと判定することを特徴とする定期券経路データ確認システム。 Read means for generating a commuter pass route as much data as possible, which may be assumed, and the generated commuter pass route data to each company of the regular ticket issuing simulator, to generate the data as fare-kilometers of each of the departure station via the station, If there is a disagreement between the fare / km section that consists of means for matching the fare / km information output by the commuter pass issuance simulator of each company and the fare / km section, the fare / km section will be corrected. any Hatsueki to enter for fare-kilometrage were matched company season ticket issued simulator with respect to the path - destination station means for generating a data, any of and produced Hatsueki - destination station data of each company generates route data read into commutation ticket issuance simulator, and a route data butting portion comprises means that Tsukiawasu path data outputted from companies commutation ticket issuance simulator And period tickets butting simulator,
The processing logic of the commuter pass issuance simulator of each company is installed, and when there is route data that can not be matched as a result of matching by the commuter pass matching simulator, whether the processing logic is different by reading the route data And a logic simulator for verifying
The logic simulator determines that there is no problem when the encoded data that is not a branch station or a crossing station is excessively registered.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2005083269A JP4570087B2 (en) | 2005-03-23 | 2005-03-23 | Commuter pass route data confirmation system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2005083269A JP4570087B2 (en) | 2005-03-23 | 2005-03-23 | Commuter pass route data confirmation system |
Publications (3)
| Publication Number | Publication Date |
|---|---|
| JP2006268241A JP2006268241A (en) | 2006-10-05 |
| JP2006268241A5 JP2006268241A5 (en) | 2010-01-07 |
| JP4570087B2 true JP4570087B2 (en) | 2010-10-27 |
Family
ID=37204180
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP2005083269A Active JP4570087B2 (en) | 2005-03-23 | 2005-03-23 | Commuter pass route data confirmation system |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JP4570087B2 (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002042184A (en) * | 2000-07-21 | 2002-02-08 | Mitsubishi Electric Corp | Usage charge management method, its device, and its system |
| JP2004030060A (en) * | 2002-06-24 | 2004-01-29 | Toshiba Corp | Systems and methods for developing station work equipment and automatic ticket gate |
| JP2004185372A (en) * | 2002-12-04 | 2004-07-02 | Ntt Data Corp | Fare calculating method, program for making computer execute method, and fare calculating device |
| JP2004240652A (en) * | 2003-02-05 | 2004-08-26 | Central Japan Railway Co | Encode check device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3432690B2 (en) * | 1997-03-06 | 2003-08-04 | 日本信号株式会社 | Automatic payment machine |
| JP3452793B2 (en) * | 1998-04-27 | 2003-09-29 | 日本信号株式会社 | Entrance / exit judgment device |
-
2005
- 2005-03-23 JP JP2005083269A patent/JP4570087B2/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002042184A (en) * | 2000-07-21 | 2002-02-08 | Mitsubishi Electric Corp | Usage charge management method, its device, and its system |
| JP2004030060A (en) * | 2002-06-24 | 2004-01-29 | Toshiba Corp | Systems and methods for developing station work equipment and automatic ticket gate |
| JP2004185372A (en) * | 2002-12-04 | 2004-07-02 | Ntt Data Corp | Fare calculating method, program for making computer execute method, and fare calculating device |
| JP2004240652A (en) * | 2003-02-05 | 2004-08-26 | Central Japan Railway Co | Encode check device |
Also Published As
| Publication number | Publication date |
|---|---|
| JP2006268241A (en) | 2006-10-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100985540B1 (en) | On-line correction of check code line recognition in point-of-sale stations | |
| CN1355909A (en) | Storing electronic receipts on removable storage medium | |
| US5661289A (en) | Card and card check method | |
| CN109657763A (en) | A kind of application method of electronic ticket and electronic ticket | |
| JP4570087B2 (en) | Commuter pass route data confirmation system | |
| JP2006268240A (en) | Season ticket route data confirmation system | |
| JP4857737B2 (en) | Fare verification device | |
| JPWO2006013757A1 (en) | Finished vehicle inspection verification system and method | |
| CN1230774C (en) | Identification system using IC for parking card | |
| CN103914775A (en) | Channel production management and control system | |
| JP4570088B2 (en) | Fare verification system | |
| US4675824A (en) | Method of replacing a tolling system for toll roads | |
| JP4514048B2 (en) | Processing logic verification equipment for station equipment | |
| JP4614335B2 (en) | Processing logic verification equipment for station equipment | |
| JP4852872B2 (en) | Fare determination program confirmation device, fare determination program confirmation method, and confirmation program | |
| JP4857714B2 (en) | Boarding fee verification system | |
| JP4942019B2 (en) | Commuter pass matching simulator | |
| JP4984599B2 (en) | Failure case search system, fare calculation failure case search system, charge calculation failure case search system | |
| CN109726955A (en) | A kind of shipping tracking location system | |
| JP3886488B2 (en) | Proper repair information provision system | |
| JP3814806B2 (en) | Method and device for issuing commuter pass | |
| JP6625350B2 (en) | Parking management system | |
| CN114118949B (en) | Information processing system and method for bill | |
| JP2008097428A (en) | Commutation ticket data generating system | |
| JP5023860B2 (en) | Test pattern generator for fare calculation verification |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| A621 | Written request for application examination |
Free format text: JAPANESE INTERMEDIATE CODE: A621 Effective date: 20070327 |
|
| A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20091116 |
|
| A977 | Report on retrieval |
Free format text: JAPANESE INTERMEDIATE CODE: A971007 Effective date: 20091201 |
|
| A131 | Notification of reasons for refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A131 Effective date: 20100514 |
|
| A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20100713 |
|
| TRDD | Decision of grant or rejection written | ||
| A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 Effective date: 20100806 |
|
| A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 |
|
| A61 | First payment of annual fees (during grant procedure) |
Free format text: JAPANESE INTERMEDIATE CODE: A61 Effective date: 20100806 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20130820 Year of fee payment: 3 |
|
| R150 | Certificate of patent or registration of utility model |
Free format text: JAPANESE INTERMEDIATE CODE: R150 Ref document number: 4570087 Country of ref document: JP Free format text: JAPANESE INTERMEDIATE CODE: R150 |
|
| S533 | Written request for registration of change of name |
Free format text: JAPANESE INTERMEDIATE CODE: R313533 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20130820 Year of fee payment: 3 |
|
| R350 | Written notification of registration of transfer |
Free format text: JAPANESE INTERMEDIATE CODE: R350 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
| R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |