Tutorial on message sequence charts
Computer Networks and ISDN Systems - Special issue on SDL and MSC
Modal logic
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
Verification of a Radio-Based Signaling System Using the STATEMATE Verification Environment
Formal Methods in System Design
An Automata Based Interpretation of Live Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Check it out: on the efficient formal verification of live sequence charts
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Synthesis revisited: generating statechart models from scenario-based requirements
Formal Methods in Software and Systems Modeling
Temporal logic for scenario-based specifications
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Monitor petri nets for security monitoring
Proceedings of the International Workshop on Security and Dependability for Resource Constrained Embedded Systems
Model-Based generation of run-time monitors for AUTOSAR
ECMFA'13 Proceedings of the 9th European conference on Modelling Foundations and Applications
| Hi-index | 0.00 |
An efficient and mathematically rigorous translation from Live Sequence Charts (LSCs) to temporal logic is essential to providing an end-to-end specification and verification method for System on Chip (SoC) protocols. Without mathematical rigor, no translation can be trusted to completely represent the LSC specification, while inefficiency renders even provably sound translations useless in verifying the correctness of industrial-strength protocols. Previous work shows that the LSC-to-temporal logic and LSC-to-automata translations can be automated and formalized for the LSC language. In the LSC-to-temporal logic translation, the extraordinary size of the resulting formula limits the scalability of the charts that can be translated and verified. Our work, on the other hand, leverages intuitive temporal logic reductions to generate a formula that is at most quadratic in the size of the chart and demonstrates the benefits of the improved translation on several examples.