Encoding PAMR into (Timed) EFSMs

  • Authors:
  • Manuel Núñez;Ismael Rodríguez

  • Affiliations:
  • -;-

  • Venue:
  • FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we show how the formal framework introduced in PAMR (Process Algebra for the Management of Resources) can be included into a notion of Extended Finite State Machines (in short EFSM). First, we give the definition of process. Following the lines of PAMR, a process consists not only of information about its behavior but also of information about the preference for resources. This information will be encoded into a model based on EFSMs. In contrast with the original definition of PAMR, a notion of time is included in our processes, that is, transitions take time to be performed. Systems are defined as the composition of several processes. We present different implementation relations, depending on the interpretation of time, and we relate them. Finally, we study how tests cases are defined and applied to implementations.