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

M.A. Reniers, M.J. Weerdenburg, van

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)
49 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationProceedings of the 2nd International Symposium on Fundamentals of Software Engineering (FSEN 2007) 17-19 April 2007, Tehran, Iran
EditorsF. Arbab, M. Sirjani
Place of PublicationBerlijn, Germany
PublisherSpringer
Pages287-301
ISBN (Print)978-3-540-75697-2
DOIs
Publication statusPublished - 2007
Eventconference; FSEN 2007, Tehran, Iran; 2007-04-17; 2007-04-19 -
Duration: 17 Apr 200719 Apr 2007

Publication series

NameLecture Notes in Computer Science
Volume4767
ISSN (Print)0302-9743

Conference

Conferenceconference; FSEN 2007, Tehran, Iran; 2007-04-17; 2007-04-19
Period17/04/0719/04/07
OtherFSEN 2007, Tehran, Iran

Fingerprint Dive into the research topics of 'Action abstraction in timed process algebra : the case for an untimed silent step'. Together they form a unique fingerprint.

Cite this