Learn More
This paper presents a general method for computing quantitative information about finite-state real-time systems. We have developed algorithms that compute exact bounds on the delay between two speci$ed events and on the number of occurrences of an event in a given interval. This technique allows us to determine performance measures such as schedulability(More)
This correspondence describes new two-stage data compression algorithms of Kanji character patterns digitized on the hexagonal mesh. One third of the pattern elements are stored, and an additional small amount of data is used to correct effors in the recovered pattern. A data reduction of 60 percent has been achieved.