Real-time C Code Generation in Ptolemy II for the Giotto Model of Computation

Arrays are one of the most fundamental and widely applied data structures, which are useful for modeling both logical designs and physical implementations of multi-dimensional data objects sharing the same type of homogeneous elements. However, there is a lack of a formal model of the universal array based on it any array instance can be derived. This paper studies the fundamental properties of Universal Array (UA) and presents a comprehensive design pattern. A denotational mathematics, Real-Time Process Algebra (RTPA), allows both architectural and behavioral models of UA to be rigorously designed and refined in a top-down approach. The conceptual model of UA is rigorously described by tuple- and matrix-based mathematical models. The architectural models of UA are created using RTPA architectural modeling methodologies known as the Unified Data Models (UDMs). The physical model of UA is implemented using linear list that is indexed by an offset pointer of elements. The behavioral models of UA are specified and refined by a set of Unified Process Models (UPMs). As a case study, the formal UA models are implemented in Java. This work has been applied in a number of real-time and nonreal-time systems such as compilers, a file management system, the real-time operating system (RTOS+), and the ADT library for an RTPA-based automatic code generation tool.

Download Full-text

An Operational Semantics of Real-Time Process Algebra (RTPA)

Discoveries and Breakthroughs in Cognitive Informatics and Natural Intelligence ◽

10.4018/978-1-60566-902-1.ch012 ◽

2011 ◽

pp. 218-238

Author(s):

Yingxu Wang ◽

Cyprian F. Ngolah

Keyword(s):

Real Time ◽

Code Generation ◽

Intelligent Systems ◽

Process Algebra ◽

System Modeling ◽

Operational Semantics ◽

Software Systems ◽

Time Process ◽

Modeling Methodology ◽

Reduction Machine

The need for new forms of mathematics to express software engineering concepts and entities has been widely recognized. Real-time process algebra (RTPA) is a denotational mathematical structure and a system modeling methodology for describing the architectures and behaviors of real-time and nonrealtime software systems. This article presents an operational semantics of RTPA, which explains how syntactic constructs in RTPA can be reduced to values on an abstract reduction machine. The operational semantics of RTPA provides a comprehensive paradigm of formal semantics that establishes an entire set of operational semantic rules of software. RTPA has been successfully applied in real-world system modeling and code generation for software systems, human cognitive processes, and intelligent systems.

Download Full-text

An Operational Semantics of Real-Time Process Algebra (RTPA)

Software Applications ◽

10.4018/978-1-60566-060-8.ch193 ◽

2009 ◽

pp. 3340-3360

Author(s):

Yingxu Wang ◽

Cyprian F. Ngolah

Keyword(s):

Real Time ◽

Code Generation ◽

Intelligent Systems ◽

Process Algebra ◽

System Modeling ◽

Operational Semantics ◽

Software Systems ◽

Time Process ◽

Modeling Methodology ◽

Reduction Machine

The need for new forms of mathematics to express software engineering concepts and entities has been widely recognized. Real-time process algebra (RTPA) is a denotational mathematical structure and a system modeling methodology for describing the architectures and behaviors of real-time and nonreal-time software systems. This article presents an operational semantics of RTPA, which explains how syntactic constructs in RTPA can be reduced to values on an abstract reduction machine. The operational semantics of RTPA provides a comprehensive paradigm of formal semantics that establishes an entire set of operational semantic rules of software. RTPA has been successfully applied in real-world system modeling and code generation for software systems, human cognitive processes, and intelligent systems.

Download Full-text