{'fraction_non_alphanumeric': 0.03048780487804878, 'fraction_numerical': 0.0, 'mean_word_length': 4.984375, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Specification of abstract data types using real-time process algebra (RTFA)

The real-time process algebra (RTFA) provides a new approach to the specification and refinement of real-time systems. This paper presents a study on the specification of a set of abstract data types (ADTs) by using RTPA. The objectives of this work are to demonstrate the expressiveness of the RTPA notations and specification method, and to build a fundamental ADT library for RTPA by recursively applying the RTPA notations. Eleven ADTs, such as stack, record, array, queue, sequence, list, etc., have been selected and specified in RTPA. An ADT, Queue, is adopted in this paper to shown the RTPA specification and refinement methods. The queue specification in RTPA is contrasted to a conventional logic-based specification, and the features and advantages of the RTPA notation system is demonstrated. This case study shows that with RTPA, ADTs can be described and specified not only as static data types, but also dynamic real-time components, which enables ADTs to be applied in the real-time environment as predefined or embedded special architectural components.