A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Priorities in process algebras
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Theoretical Computer Science
Time-abstracted bisimulation: implicit specifications and decidability
Information and Computation
The Real-Time Process Algebra (RTPA)
Annals of Software Engineering
On Observing Dynamic Prioritised Actions in SOC
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On mathematical laws of software
Transactions on computational science II
Design and Implementation of an Autonomic Code Generator Based on RTPA
International Journal of Software Science and Computational Intelligence
| Hi-index | 0.00 |
Many real-time process algebras have the maximal progress assumption. In those process algebras, the time intervals in which actions are enabled are left-closed. This paper presents a process algebra that satisfies the maximal progress assumption and allows left-open intervals. A non-observable time step is introduced to model the time when an urgent action enabled in interval (0,1) is taken. Furthermore, we have to distinguish between observable actions and actions which only get enabled after a non-observable time step. This is necessary, since the latter actions may only produce internal actions. The distinction is done by extending the set of actions by marked actions.The real-time process algebra presented here is an extension of Milner's CCS. This algebra can be used to model dynamic priority of actions at the same point in time. We introduce various equivalence relations based on bisimulation.