Buchholtz, Mikael1; Andersen, Jacob3; Løvengreen, Hans Henrik4
1 Department of Informatics and Mathematical Modeling, Technical University of Denmark2 Computer Science and Engineering, Department of Informatics and Mathematical Modeling, Technical University of Denmark3 unknown4 Department of Applied Mathematics and Computer Science, Technical University of Denmark
We present initial work on a timed process algebra that models sharing of processor resources allowing preemption at arbitrary points in time. This enables us to model both the functional and the timely behaviour of concurrent processes executed on a single processor. We give a refinement relation that describes that one process is more deterministic than another. Applications of the model for process scheduling, programming language semantics, and kernel development are outlined.