Name
Abstract | ||
|---|---|---|
We give a detailed construction of a nite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has been no precise description of such a transition system. Several analysis and verication problems concern- ing MSG specications can be solved using this transition system. The transition system can be used to construct correct tools for problems like model-checking and detecting implied scenarios in MSG specications. The transition system we give can also be used for a bounded analysis of general (not necessarily com-connected) MSG specications. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-16558-0_45 | formal methods |
Keywords | Field | DocType |
msg specification,verification problem,bounded analysis,analysing message sequence graph,detailed construction,com-connected message sequence graph,transition system,finite-state transition system,computer science,model checking | Transition system,Graph,Computer science,Correctness,Theoretical computer science,TRACE (psycholinguistics),Transitive closure,Bounded function | Conference |
Volume | ISSN | ISBN |
6415 | 0302-9743 | 3-642-16557-5 |
Citations | PageRank | References |
3 | 0.44 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joy Chakraborty | 1 | 3 | 0.44 |
| Deepak D'souza | 2 | 239 | 17.90 |
| K. Narayan Kumar | 3 | 139 | 6.98 |