Operational semantics for real-time processes with action refinement

2005 ◽  
Author(s):  
Xiuli Sun ◽  
J. Wu
Keyword(s):  
Real Time ◽  
Operational Semantics ◽  
Action Refinement

scholarly journals Time Petri Nets with Action Duration

2013 ◽  
Vol 4 (2) ◽  
pp. 62-83 ◽  
Author(s):  
N. Belala ◽  
D.E. Saїdouni ◽  
R. Boukharrou ◽  
A.C. Chaouche ◽  
A. Seraoui ◽  
...  
Keyword(s):  
Petri Nets ◽  
Real Time ◽  
Timed Automata ◽  
Operational Semantics ◽  
Time Interval ◽  
Timing Constraints ◽  
Time Petri Nets ◽  
Real Time Systems ◽  
High Level ◽  
Time Systems

The design of real-time systems needs a high-level specification model supporting at the same time timing constraints and actions duration. The authors introduce in this paper an extension of Petri Nets called Time Petri Nets with Action Duration (DTPN) where time is associated with transitions. In DTPN, the firing of transitions is bound to a time interval and transitions represent actions which have explicit durations. The authors give an operational semantics for DTPN in terms of Durational Action Timed Automata (DATA). DTPN considers both timing constraints and durations under a true-concurrency semantics with an aim of better expressing concurrent and parallel behaviours of real-time systems.

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

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.

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

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.

scholarly journals A Causal Operational Semantics of Action Refinement

1995 ◽  
Vol 122 (1) ◽  
pp. 97-119 ◽  
Author(s):  
P. Degano ◽  
R. Gorrieri
Keyword(s):  
Operational Semantics ◽  
Action Refinement
Sign in / Sign up

Export Citation Format

Share Document