Temporal logic for scenario-based specifications

Hillel Kugler, David Harel, Amir Pnueli, Yuan Lu, Yves Bontemps

Research output: Contribution to journalConference articlepeer-review

60 Scopus citations

Abstract

We provide semantics for the powerful scenario-based language of live sequence charts (LSCs). We show how the semantics of live sequence charts can be captured using temporal logic. This is done by studying various subsets of the LSC language and providing an explicit translation into temporal logic. We show how a kernel subset of the LSC language (which omits variables, for example) can be embedded within the temporal logic CTL*. For this kernel subset the embedding is a strict inclusion. We show that existential charts can be expressed using the branching temporal logic CTL while universal charts are in the intersection of linear temporal logic and branching temporal logic LTL ∩ CTL. Since our translations are efficient, the work described here may be used in the development of tools for analyzing and executing scenario-based requirements and for verifying systems against such requirements.

Original languageEnglish
Pages (from-to)445-460
Number of pages16
JournalLecture Notes in Computer Science
Volume3440
DOIs
StatePublished - 2005
Externally publishedYes
Event11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005 - Edinburgh, United Kingdom
Duration: 4 Apr 20058 Apr 2005

Fingerprint

Dive into the research topics of 'Temporal logic for scenario-based specifications'. Together they form a unique fingerprint.

Cite this