On Message Sequence Graphs and Finitely Generated Regular MSC Languages

Henriksen, Jesper G.; Mukund, Madhavan; Kumar, K. Narayan; Thiagarajan, P. S.

doi:10.1007/3-540-45022-x_57

Cited by 43 publications

(39 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[2], allowing processes to progress along the HMSC with each chart being in a different node may introduce non-regular behavior and is the cause of undecidability of certain properties. Undecidability results and approaches to restrict HMSC's in order to avoid these problems appear in [16,17,11]. Live sequence charts have been used for testing and verification of system models.…”

Section: Related Workmentioning

confidence: 99%

Temporal Logic for Scenario-Based Specifications

Kugler

Harel

Pnueli

et al. 2005

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Temporal Logic for Scenario-Based Specifications

Kugler

Harel

Pnueli

et al. 2005

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…However, there exist regular MSC languages that are not finitely generated [6,9]. Every finitely generated regular MSC language can be represented as a locally synchronized HMSC [8].…”

Section: Finitely Generated Msc Languagesmentioning

confidence: 99%

Netcharts: Bridging the Gap between HMSCs and Executable Specifications

Mukund

Kumar

Thiagarajan

2003

CONCUR 2003 - Concurrency Theory

Self Cite

View full text Add to dashboard Cite

Abstract. We define a new notation called netcharts for describing sets of message sequence chart scenarios (MSCs). Netcharts correspond to a distributed version of High-level Message Sequence Charts (HMSCs). Netcharts improve on HMSCs in two respects. (i) Netcharts admit a natural and direct translation into communicating finite-state machines, unlike HMSCs, for which the realization problem is nontrivial. (ii) Netcharts can describe all regular MSC languages (sets of MSCs in which channel capacities have a finite upper bound), unlike HMSCs, which can only describe finitely-generated regular MSC languages.

show abstract

“…A sufficient condition is that the HMSC satisfy a structural condition called boundedness [2]. Unfortunately, boundedness is not a necessary condition for regularity-in general, it is undecidable whether an HMSC defines a regular language [7]. However bounded HMSCs do satisfy a completeness property.…”

Section: From Mscs To Finite-state Automatamentioning

confidence: 99%

“…However bounded HMSCs do satisfy a completeness property. It turns out that bounded HMSCs can describe all finitely-generated regular collections of MSCs-that is, collections that are generating by concatenating MSCs from a finite set of "atomic" MSCs [7].…”

Section: From Mscs To Finite-state Automatamentioning

confidence: 99%

See 1 more Smart Citation

Checking Consistency of SDL+MSC Specifications

D’Souza

Mukund

2003

Model Checking Software

Self Cite

View full text Add to dashboard Cite

Abstract. We consider the problem of checking whether a distributed system described in SDL is consistent with a set of MSCs that constrain the interaction between the processes. In general, the MSC constraints are of two kinds, positive and negative. We would like the SDL specification to execute all the positive scenarios "sensibly". On the other hand, the negative MSCs rule out some interactions as illegal. We would then like to verify that all the remaining legal interactions satisfy a desired global property, specified in linear-time temporal logic. We outline an approach to solve this problem using Spin, building in a modular way on existing tools.

show abstract

On Message Sequence Graphs and Finitely Generated Regular MSC Languages

Cited by 43 publications

References 10 publications

Temporal Logic for Scenario-Based Specifications

Temporal Logic for Scenario-Based Specifications

Netcharts: Bridging the Gap between HMSCs and Executable Specifications

Checking Consistency of SDL+MSC Specifications

Contact Info

Product

Resources

About