Skip to main navigation Skip to search Skip to main content

CTR: A calculus of timed refinement

  • University of Latvia

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

1 Citation (Scopus)

Abstract

This paper presents CTR - a process algebraic framework for loose specification of time quantity sensitive operational behaviour of reactive systems. CTR terms are provided both with operational and specification semantics (via the notion of specification refinement). Besides the intuitive justification of appropriateness of the refinement notion, a preservation theorem is proved for a timed variant of Henneesy-Milner logic. A comparison of CTR with the related formalism of Timed Modal Specifications, and with the timed process calculi TCCS due to Wang is given. Some pragmatics of the application of CTR is sketched on a critical resource access example.

Original languageEnglish
Title of host publicationCONCUR 1995
Subtitle of host publicationConcurrency Theory - 6th International Conference, Proceedings
EditorsInsup Lee, Scott A. Smolka
PublisherSpringer Verlag
Pages516-530
Number of pages15
ISBN (Print)3540602186, 9783540602187
DOIs
Publication statusPublished - 1995
Externally publishedYes
Event6th International Conference on Concurrency Theory, CONCUR 1995 - Philadelphia, United States
Duration: 21 Aug 199524 Aug 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume962
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Concurrency Theory, CONCUR 1995
Country/TerritoryUnited States
CityPhiladelphia
Period21/08/9524/08/95

Fingerprint

Dive into the research topics of 'CTR: A calculus of timed refinement'. Together they form a unique fingerprint.

Cite this