Abstraction in real time process algebra

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

A Denotational Semantics of Real-Time Process Algebra (RTPA)

Discoveries and Breakthroughs in Cognitive Informatics and Natural Intelligence ◽

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

2011 ◽

pp. 200-217

Author(s):

Yingxu Wang ◽

Xinming Tan

Keyword(s):

Real Time ◽

Process Algebra ◽

Denotational Semantics ◽

Time Interval ◽

Time Process ◽

Denotational Semantic ◽

Time Intervals ◽

Event Time ◽

Driven System ◽

New Framework

Real-time process algebra (RTPA) is a form of denotational mathematics for dealing with fundamental system behaviors such as timing, interrupt, concurrency, and event/time/interrupt-driven system dispatching. Because some key RTPA processes cannot be described adequately in conventional denotational semantic paradigms, a new framework for modeling time and processes is sought in order to represent RTPA in denotational semantics. Within this framework, time is modeled by the elapse of process execution. The process environment encompasses states of all variables represented as mathematical maps, which project variables to their corresponding values. Duration is introduced as a pair of time intervals and the environment to represent the changes of the process environment during a time interval. Temporal ordered durations and operations on them are used to denote process executions. On the basis of these means, a comprehensive set of denotational semantics for RTPA are systematically developed and formally expressed.

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

Implementation of the kernel techniques of real-time process algebra

Canadian Conference on Electrical and Computer Engineering, 2005. ◽

10.1109/ccece.2005.1557389 ◽

2006 ◽

Author(s):

Xinming Tan ◽

Yingxu Wang ◽

C.F. Ngolah

Keyword(s):

Real Time ◽

Process Algebra ◽

Time Process

Download Full-text