12th IEEE International Conference on Engineering Complex Computer Systems (ICECCS 2007) Achieving Discrete Relative Timing with Untimed Process Algebra Auckland, New Zealand July 11-July 14 ISBN: 0-7695-2895-3
For many systems, timing aspects are essential. Therefore, when modelling these systems, time should somehow be represented. In the past, many timed pro- cess algebras have been developed, using untimed pro- cess algebras as initial inspiration. In this paper, we take another approach, considering the possibility to model timing aspects with an untimed process algebra. The advantage is that the algebra itself does not need to be extended, and the available tools can be reused. In contrast to other work, where this approach has been looked at, we focus on ease of modelling, and single delay steps of varying sizes. We present the timing mechanism used, our approach, and some examples.
Citation:
Anton Wijs, "Achieving Discrete Relative Timing with Untimed Process Algebra," iceccs, pp.35-46, 12th IEEE International Conference on Engineering Complex Computer Systems (ICECCS 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||