Analysis of Timed Processes with Data Using Algebraic Transformations

  • Authors:
  • Michel A. Reniers;Yaroslav S. Usenko

  • Affiliations:
  • Technical University of Eindhoven;Technical University of Eindhoven

  • Venue:
  • TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The language µCRL, see [9], offers a uniform framework for the specification of data and processes. Data are specified by equational specifications (cf. [4]): one can declare sorts and functions working upon these sorts, and describe the meaning of these functions by equational axioms. Processes are described in process algebraic style, where the particular process syntax stems from ACP [5, 3], extended with data-parametric ingredients: there are constructs for conditional composition, and for data-parametric choice and communication. As is common in process algebra, infi- nite processes are specified by means of (finite systems of) recursive equations. In µCRL such equations can also be data-parametric. As an example each solution for the equation X = a驴X specifies the process that can only repeatedly execute a, and so does Y(17) where Y(n) is defined by the data-parametric equation Y(n)=a 驴 Y(n + 1) with n 驴 Nat.