Specification of abstract data types using real-time process algebra (RTFA)

2012 ◽

pp. 288-315

Author(s):

Yingxu Wang ◽

Xinming Tan ◽

Cyprian F. Ngolah ◽

Philip Sheu

Keyword(s):

Real Time ◽

Cognitive Learning ◽

Process Models ◽

Behavioral Models ◽

Abstract Data Types ◽

Data Types ◽

Dynamic Behaviors ◽

Modeling Methodology ◽

Abstract Data ◽

Data Objects

Type theories are fundamental for underpinning data object modeling and system architectural design in computing and software engineering. Abstract Data Types (ADTs) are a set of highly generic and rigorously modeled data structures in type theory. ADTs also play a key role in Object-Oriented (OO) technologies for software system design and implementation. This paper presents a formal modeling methodology for ADTs using the Real-Time Process Algebra (RTPA), which allows both architectural and behavioral models of ADTs and complex data objects. Formal architectures, static behaviors, and dynamic behaviors of a set of ADTs are comparatively studied. The architectural models of the ADTs are created using RTPA architectural modeling methodologies known as the Unified Data Models (UDMs). The static behaviors of the ADTs are specified and refined by a set of Unified Process Models (UPMs) of RTPA. The dynamic behaviors of the ADTs are modeled by process dispatching technologies of RTPA. This work has been applied in a number of real-time and non-real-time system designs such as a Real-Time Operating System (RTOS+), a Cognitive Learning Engine (CLE), and the automatic code generator based on RTPA.

Download Full-text

The Formal Design Models of a Set of Abstract Data Types (ADTs)

International Journal of Software Science and Computational Intelligence ◽

10.4018/jssci.2010100106 ◽

2010 ◽

Vol 2 (4) ◽

pp. 72-100 ◽

Cited By ~ 9

Author(s):

Yingxu Wang ◽

Xinming Tan ◽

Cyprian F. Ngolah ◽

Philip Sheu

Keyword(s):

Real Time ◽

Architectural Design ◽

Cognitive Learning ◽

Process Models ◽

Complex Data ◽

Abstract Data Types ◽

Data Types ◽

Real Time System ◽

Dynamic Behaviors ◽

Abstract Data

Type theories are fundamental for underpinning data object modeling and system architectural design in computing and software engineering. Abstract Data Types (ADTs) are a set of highly generic and rigorously modeled data structures in type theory. ADTs also play a key role in Object-Oriented (OO) technologies for software system design and implementation. This paper presents a formal modeling methodology for ADTs using the Real-Time Process Algebra (RTPA), which allows both architectural and behavioral models of ADTs and complex data objects. Formal architectures, static behaviors, and dynamic behaviors of a set of ADTs are comparatively studied. The architectural models of the ADTs are created using RTPA architectural modeling methodologies known as the Unified Data Models (UDMs). The static behaviors of the ADTs are specified and refined by a set of Unified Process Models (UPMs) of RTPA. The dynamic behaviors of the ADTs are modeled by process dispatching technologies of RTPA. This work has been applied in a number of real-time and non-real-time system designs such as a Real-Time Operating System (RTOS+), a Cognitive Learning Engine (CLE), and the automatic code generator based on RTPA.

Download Full-text

Abstract data types in industrial real time basic

Real Time Control of Large Scale Systems - Lecture Notes in Control and Information Sciences ◽

10.1007/bfb0008325 ◽

2005 ◽

pp. 448-456

Author(s):

G. M. Bull

Keyword(s):

Real Time ◽

Abstract Data Types ◽

Data Types ◽

Abstract Data

Download Full-text

Towards the Temporal Approach to Abstract Data Types

Fundamenta Informaticae ◽

10.3233/fi-1988-11105 ◽

1988 ◽

Vol 11 (1) ◽

pp. 49-63

Author(s):

Andrzej Szalas

Keyword(s):

Temporal Logic ◽

Abstract Data Types ◽

Data Types ◽

First Order ◽

Abstract Data ◽

Order Completeness ◽

General Method

In this paper we deal with a well known problem of specifying abstract data types. Up to now there were many approaches to this problem. We follow the axiomatic style of specifying abstract data types (cf. e.g. [1, 2, 6, 8, 9, 10]). We apply, however, the first-order temporal logic. We introduce a notion of first-order completeness of axiomatic specifications and show a general method for obtaining first-order complete axiomatizations. Some examples illustrate the method.

Download Full-text