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

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
143 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
TitelInternational Symposium on Fundamentals of Software Engineering - International Symposium, FSEN 2007, Proceedings
RedacteurenF. Arbab, M. Sirjani
Plaats van productieBerlijn
UitgeverijSpringer
Hoofdstuk19
Pagina's287-301
Aantal pagina's15
ISBN van geprinte versie978-3-540-75697-2
DOI's
StatusGepubliceerd - 2007
Evenement2nd IPM International Symposium on Fundamentals of Software Engineering, FSEN 2007 - Tehran, Iran
Duur: 17 apr. 200719 apr. 2007

Publicatie series

NaamLecture Notes in Computer Science (LNCS)
UitgeverijSpringer
Volume4767
ISSN van geprinte versie0302-9743
ISSN van elektronische versie1611-3349

Congres

Congres2nd IPM International Symposium on Fundamentals of Software Engineering, FSEN 2007
Land/RegioIran
StadTehran
Periode17/04/0719/04/07
AnderFSEN 2007, Tehran, Iran

Vingerafdruk

Duik in de onderzoeksthema's van 'Action abstraction in timed process algebra: the case for an untimed silent step'. Samen vormen ze een unieke vingerafdruk.

Citeer dit