This paper discusses action abstraction in timed process algebras. It is observed that the leading approaches to action abstraction in timed process algebra all maintain the timing of actions, even if these actions are abstracted from.
This paper presents a novel approach to action abstraction in timed process algebras. Characteristic for this approach is that in abstracting from an action, also its timing is abstracted from. We define an abstraction operator and a timed variant of rooted branching bisimilarity and establish that this notion is an equivalence relation and a congruence.
|Name||Lecture Notes in Computer Science|
|Conference||conference; FSEN 2007, Tehran, Iran; 2007-04-17; 2007-04-19|
|Period||17/04/07 → 19/04/07|
|Other||FSEN 2007, Tehran, Iran|