On Using Syntactic Action Refinement to Derive Compositionally a Timed Efficient Implementation

In this paper, we present a durational process algebra incorporating syntactic action refinement. We study its correctness with respect to the semantic refinement in an interleaving model, namely the labelled transition systems. This defined refinement is compositional over the language operators and may provide at a given level of abstraction a timed efficient implementation for a specification.

Content

Author and article information

Conference

Publication date: July 1996

Publication date (Print): July 1996

Pages: 1-14

Affiliations

[0001]CRIN/INRIA, Université Henri Poicaré

Nancy, 54500, France.

Article

DOI: 10.14236/ewic/RW1996.5

SO-VID: ace2d9f0-aa45-457c-b34c-69ef0a4799be

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Proceedings of the BCS-FACS 7th Refinement Workshop

Conference acronym: RW

Conference number: 7

Conference location: Bath

Conference date: 3-5 July 1996

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: BCS-FACS 7th Refinement Workshop

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/RW1996.5

Self URI (journal page): https://ewic.bcs.org/

Studying business & IT? Drive your professional career forwards with BCS books - for a 20% discount click here: shop.bcs.org

On Using Syntactic Action Refinement to Derive Compositionally a Timed Efficient Implementation

Abstract