JP2006268243A - Processing logic verification equipment for station equipment - Google Patents

Abstract

PROBLEM TO BE SOLVED: To shorten the time required for verification and reduce the cost and prevent erroneous receipt of fare and misjudgment.
SOLUTION: A plurality of determination modules (21-) for extracting all fare settlement origin station candidates for a fixed period read from a composite ticket, when the fare determination data (10) that has already been matched is used. 1, 21-2,... 21 -n) and an abutting means (22) for abutting the settlement origin station candidates extracted by each determination module.
[Selection] Figure 1

Description

  The present invention relates to an apparatus for verifying the processing logic of station equipment such as an automatic ticket gate, a settlement machine, and a window processing machine.

  IC card compound tickets that store commuter passes and SF cards (stored fair cards) are used, and in ticketing station equipment (automatic ticket gates, checkout machines, counter processing machines, etc.) that process compound tickets, IC card data is read and the shortest and lowest fare is calculated by referring to all route data stored.

  However, fare calculation may be complicated due to the complicated connection of railroad tracks, and problems with fare calculation have been pointed out. As a countermeasure, conventionally, a plurality of judgment simulators equipped with processing modules for ticket gate system station equipment are used, and at each specific period, it matches the period assumed by humans centering on problems pointed out in the past. A logic pattern (path pattern) is applied to a determination simulator, and the determination results are collated to verify the validity of the determination module.

  However, in verification with logic patterns assumed by humans centering on past problems, there are unavoidable patterns that are not expected, and in order to avoid this, it is automatically performed at each specific type of periodicity. You must check the full boarding / exiting pattern. However, the total boarding / exiting pattern for all routes on the railroad track is enormous, and this is not practical.

The present invention is intended to solve the above-described problems, and enables verification of a determination module for an IC card compound ticket using a single route pattern, thereby shortening the time required for verification and reducing costs, The purpose is to prevent misreception and misjudgment.
For this purpose, the present invention is based on the determination module when using the completed fare determination data, and the fare between the two stations using the determination module has already been verified, and a plurality of determinations for extracting all the settlement origin station candidates for the period read from the composite ticket Module,
Reconciliation means for reconciling the settlement origin station candidates extracted by each determination module;
It is provided with.

  The present invention uses legitimate fare determination data collated between companies in advance and a determination module that can legitimately process the fare determination data only in the case of an SF trip. The determination module of each company has already calculated that the correct fare is calculated only in the case of the SF trip from the valid fare determination data. Using such fare determination data and the determination module of each company, the IC card compound ticket data is read to extract all the periodic settlement starting station candidates, and the settlement starting station candidates extracted by each determination module are collated. If there is a mismatch, the determination module is corrected. In the case of SF trips (fares between two stations), since all of them have already been matched, it is sufficient to verify the judgment module for the composite ticket by matching all the settlement origin station candidates with one route pattern. While shortening and cost reduction, it is possible to prevent wrong fare collection and misjudgment.

Embodiments of the present invention will be described below.
FIG. 1 is a block diagram illustrating a processing logic verification apparatus according to the present invention, and FIG. 2 is a diagram illustrating a determination process.
In FIG. 1, the fare determination data 10 includes station numbers of all routes created by each manufacturer, intersections of all routes, branch stations, latch data and kilometers (km between stations), routes between arbitrary stations, and routes thereof. Data for calculating the mileage, fare, encoding information of commuter pass (departure / arrival station, transit station) and fare for any route, and data for calculating the fare for all routes across each company line in advance It is.

  The logic verification device 20 has determination modules 21-1, 21-2,... 21-n of each company and means 22 for matching the output of each determination module. The determination modules 21-1, 21-2,..., 21-n of the respective companies have already matched the fare calculated for the SF trip (riding only by SF) using the above-mentioned valid fare determination data. It is a determination module that can calculate the correct fare between two stations from the fare determination data. Then, with these determination modules, all the settlement origin station candidates for the period read from the composite ticket are extracted. The matching means 22 matches the settlement origin station candidates extracted by the determination modules 21-1, 21-2, ... 21-n. If there is a mismatch, the processing logic of the determination module is modified to match the settlement origin station candidates extracted by all the determination modules.

  Judgment modules 21-1, 21-2, ... 21-n have been verified to be able to calculate the correct fare for two stations, so all routes outside the regular route are targeted for calculating the fare of a composite ticket. There is no need, and if only one route is verified, verification for other routes can be omitted, and it is only necessary to correctly extract a periodic settlement origin station candidate.

  A process for determining a fare using the processing logic verification apparatus as shown in FIG. 1 will be described with reference to FIG. In FIG. 2, the commuter pass route of the composite ticket is E station-F station (passage station) -G station, and it is assumed that the train rides at A station and gets off at H station.

  In the determination module, all the commuter pass settlement station candidates are extracted. Here, it is assumed that E station and G station which are end stations, and F station which is a crossing station. Such a process is performed by the determination module of each company so that all the determination modules of each company can extract the same settlement origin station candidate. If the settlement starting station candidate can be correctly extracted, the determination module can correctly calculate the fare between the two stations. Therefore, the cheapest settlement starting station E is extracted from the boarding station A, and the fare between A station and E station is calculated. Next, in the same manner, the lowest settlement starting station G is extracted from the getting-off station H, and the fare between the G station and the H station is calculated. Therefore, the cheapest fare using the regular route is AE fare + GH fare. In this example, all the regular routes are used, but of course, a part of the regular route may be used. Next, the lowest fare A-D-H from the boarding station A using only SF to the getting-off station H is calculated.

Next, compare the lowest fare using the regular route with the lowest fare using only the SF,
If the AE fare + GH fare> A-D-H fare, the SF fare is adopted, otherwise the cheapest fare using the regular route is adopted.
In this case, in the verification of the conventional determination module, various routes are checked by changing the A station and the H station. In the present invention, the correct fare calculation between the two stations is already verified for all routes. Since it is already completed, only one route (boarding station, getting-off station) needs to be verified.

  According to the present invention, it is possible to shorten the time required for verification and reduce costs, and to prevent erroneous receipt of fare and misjudgment, so the industrial utility value is extremely large.

It is a block diagram explaining a processing logic verification device. It is a figure explaining a judgment process.

Explanation of symbols

10 ... fare determination data, 21-1, 21-2, ... 21-n ... determination module, 22 ... matching.

Claims (1)

A plurality of determination modules for extracting all the settlement origin station candidates for the regular period read from the composite ticket when the fare between the two stations using the determination module when using the combined fare determination data is already verified
Reconciliation means for reconciling the settlement origin station candidates extracted by each determination module;
A processing logic verification device for station service equipment, comprising:

Images