Testing Semantics for RTPA

  • Authors:
  • Luis Llana;Manuel Núuñez

  • Affiliations:
  • (Correspd.) Dpto. Sistemas Informáticos y Computación. Universidad Complutense de Madrid. 28040 Madrid. Spain. llana@sip.ucm.es, mn@sip.ucm.es;Dpto. Sistemas Informáticos y Computación. Universidad Complutense de Madrid. 28040 Madrid. Spain. llana@sip.ucm.es, mn@sip.ucm.es

  • Venue:
  • Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The language RTPA, Real Time Process Algebra, has been created to enable rigorous treatment of knowledge representation and manipulation in terms of to be I to have / to do in a formal and coherent framework. This language has been designed to cope with the three dimensions involved in the problem of software specification: (i) mathematical operations, (ii) event/process timing, and (iii) memory manipulation. In this paper we focus on giving a testing semantics to the second dimension: Process timing dimension. First, we will provide a SOS like operational semantics for the process relations of RTPA. Next, we will define what a test is and we will introduce a relation based on which tests are passed by processes. Finally, we will obtain an operational characterization that can be used as a first step to define a denotational sematics sound and complete with respect the testing semantics.