Located Actions in Process Algebra with Timing

Authors:
Jan A. Bergstra;Cornelis A. Middelburg
Affiliations:
Programming Research Group, University of Amsterdam, Amsterdam, the Netherlands and Department of Philosophy, Utrecht University, Utrecht, Netherlands;Computing Science Department, Eindhoven University of Technology, P.O. Box, 513, 5600 MB Eindhoven, Netherlands
Venue:
Fundamenta Informaticae
Year:
2004

Citing 12
Cited 0

Verification of an alternating bit protocol by means of process algebra

Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
Process algebra

Process algebra
A temporal calculus of communicating systems

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Real-time behaviour of asynchronous agents

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
The algebra of timed processes, ATP: theory and application

Information and Computation
A process algebra for timed systems

Information and Computation
Discrete time process algebra with silent step

Proof, language, and interaction
Computer Networks

Computer Networks
Process Algebra with Timing

Process Algebra with Timing
A congruence theorem for structured operational semantics with predicates and negative premises

Nordic Journal of Computing
An Interleaving Model for Real-Time Systems

TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
Process Algebra with Nonstandard Timing

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to spatially located actions. This process algebra makes it possible to deal with the behaviour of systems with a known time-dependent spatial distribution, such as protocols transmitting data via a mobile intermediate station. It is a reformulation of the real space process algebra from Baeten and Bergstra [Formal Aspects of Computing, 5, 1993, 481-529] in a setting with urgent actions. This leads to many simplifications.