Action abstraction in timed process algebra the case for an untimed silent step

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Reniers, M. A., & Van Weerdenburg, M. (2007). Action abstraction in timed process algebra the case for an untimed silent step. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4767 LNCS, pp. 287–301). Springer Verlag. https://doi.org/10.1007/978-3-540-75698-9_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free