L2C2: logic-based LSC consistency checking
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Verifying Communication Protocols Using Live Sequence Chart Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Scenario-based analysis and synthesis of real-time systems using UPPAAL
Proceedings of the Conference on Design, Automation and Test in Europe
Scenario-based verification of real-time systems using Uppaal
Formal Methods in System Design
Synthesis of distributed processes from scenario-based specifications
FM'05 Proceedings of the 2005 international conference on Formal Methods
Check it out: on the efficient formal verification of live sequence charts
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
| Hi-index | 0.00 |
Live Sequence Charts (LSCs) are a broad extension to Message SequenceCharts (MSCs) to capture complex inter-object communication rigorously. A tool support for LSCs, named PlayEngine, is developed to interactively "play-in" and "play-out" scenarios. However, PlayEngine cannot automatically expose system design inconsistencies, e.g. conflicts between universal charts and etc. CSP is a formal language to specify sequential behaviors of a process and communication between processes, which has powerful tool supports, e.g. FDR. Semantically, system behaviors specified by LSCs correspond to CSPýs traces and failures. This close semantic correspondence makes FDR a potential model checker for LSCs. The challenge is to discover a systematic way of constructing semantic preserving CSP models from LSCs. In this work, we investigate theoretical relations between LSCs and CSP. LSCs are formalized using trace and failure semantics so as to facilitate the semantic transformation from LSCs to CSP. The practical implication is that mature tool supports for CSP can be reused to validate LSCs. In particular, FDR is used to establish the consistency of an LSC model and perform various verification.