Towards weak sequencing for E-LOTOS

In E-LOTOS, a standard process-algebraic language for specification of concurrent and reactive real-time systems, the only form of process sequencing is strong sequencing, meaning that no action of a particular process is ever allowed to occur before complete termination of the preceding process. In the paper, we propose how to enhance the language with weak sequencing, facilitating specification of accelerated action execution, i.e. of partially overlapping processes. Defining an enhanced operational semantics, we formalize the approach for discrete-time basic E-LOTOS processes and give informal guidelines for its generalization to full E-LOTOS.