Process algebra for hybrid systems

  • Authors:
  • J. A. Bergstra;C. A. Middleburg

  • Affiliations:
  • Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB Amsterdam, Netherlands and Department of Philosophy, Utrecht University, P.O. Box 80126, 3508 TC Utrecht, Netherlands;Computing Science Department, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands

  • Venue:
  • Theoretical Computer Science - Process algebra
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg (Process Algebra with Timing, Springer, Berlin, 2002, Chapter 4), and the process algebra with propositional signals from Baeten and Bergstra (Theoret. Comput. Sci. 177 (1977) 381-405). The proposed process algebra makes it possible to deal with the behaviour of hybrid systems, i.e. systems in which the instantaneous state transitions caused by performing actions are alternated with continuous state evolutions. This process algebra has, in addition to equational axioms, rules to derive equations with the help of real analysis.