Process Algebra with Nonstandard Timing

Authors:
Kees A. Middelburg
Affiliations:
Computing Science Department, Eindhoven University of Technology, Eindhoven, the Netherlands and Department of Philosophy, Utrecht University, Utrecht, the Netherlands
Venue:
Fundamenta Informaticae
Year:
2002

Citing 7
Cited 0

Process algebra

Process algebra
The algebra of timed processes, ATP: theory and application

Information and Computation
Concrete process algebra

Handbook of logic in computer science (vol. 4)
Process Algebra with Timing

Process Algebra with Timing
An Interleaving Model for Real-Time Systems

TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
Real-Time Behaviour of Asynchronous Agents

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A Temporal Calculus of Communicating Systems

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension

Quantified Score

Hi-index	0.00

Visualization

Abstract

The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebras from the framework of process algebras with timing presented by Baeten and Middelburg [Handbook of Process Algebra, Elsevier, 2001, Chapter 10]. This possibility is useful in practice when describing and analyzing systems in which actions occur that are entirely independent. However, it is an abstraction of reality to assume that actions can be performed consecutively at the same point in time. In this paper, we propose a process algebra with timing in which this possibility is excluded, but nonstandard non-negative real numbers are included in the time domain. It is shown that this new process algebra generalizes the process algebras with timing from the aforementioned framework in a smooth and natural way.