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

3 Citations (Scopus)
140 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 publicationInternational Symposium on Fundamentals of Software Engineering - International Symposium, FSEN 2007, Proceedings
EditorsF. Arbab, M. Sirjani
Place of PublicationBerlijn
PublisherSpringer
Chapter19
Pages287-301
Number of pages15
ISBN (Print)978-3-540-75697-2
DOIs
Publication statusPublished - 2007
Event2nd IPM International Symposium on Fundamentals of Software Engineering, FSEN 2007 - Tehran, Iran, Islamic Republic of
Duration: 17 Apr 200719 Apr 2007

Publication series

NameLecture Notes in Computer Science (LNCS)
PublisherSpringer
Volume4767
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd IPM International Symposium on Fundamentals of Software Engineering, FSEN 2007
Country/TerritoryIran, Islamic Republic of
CityTehran
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