Achieving Discrete Relative Timing with Untimed Process Algebra
Presented at the IEEE International Conference on Engineering Complex Computer Systems
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.
|IEEE Computer Society Washington, DC, USA|
|IEEE International Conference on Engineering Complex Computer Systems|
|Organisation||Specification and Analysis of Embedded Systems|
Wijs, A.J. (2007). Achieving Discrete Relative Timing with Untimed Process Algebra. In Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (pp. 35–46). IEEE Computer Society Washington, DC, USA.