Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Realizability and Verification of MSC Rajeev Alur a,1
 

Summary: Realizability and Verification of MSC
Graphs
Rajeev Alur a,1
aDepartment of Computer and Information Science, University of Pennsylvania
Kousha Etessami b
bBell Laboratories, Lucent Technologies
Mihalis Yannakakis c
cAvaya Labs
Abstract
Scenario-based specifications such as message sequence charts (MSC) offer an intu-
itive and visual way to describe design requirements. MSC-graphs allow convenient
expression of multiple scenarios, and can be viewed as an early model of the system
that can be subjected to a variety of analyses. Problems such as LTL model check-
ing are undecidable for MSC-graphs in general, but are known to be decidable for
the class of bounded MSC-graphs.
Our first set of results concerns checking realizability of bounded MSC-graphs.
An MSC-graph is realizable if there is a distributed implementation that gener-
ates precisely the behaviors in the graph. There are two notions of realizability,
weak and safe, depending on whether or not we require the implementation to be
deadlock-free. It is known that for a finite set of MSCs, weak realizability is coNP-

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

 

Collections: Computer Technologies and Information Sciences